Anthony Hilton

Q: What Schools Are Affiliated With Anthony Hilton

Anthony Hilton is affiliated with the following schools: West Virginia University, University of Reading, University of Manchester

Anthony Hilton's AcademicInfluence.com Rankings

Anthony Hilton

Mathematics

#4510

World Rank

#6391

Historical Rank

Measure Theory

#2672

World Rank

#3195

Historical Rank

mathematics Degrees

Download Badge

Mathematics

Why Is Anthony Hilton Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Anthony J. W. Hilton is a British mathematician specializing in combinatorics and graph theory. His current positions are as emeritus professor of Combinatorial Mathematics at the University of Reading and professorial research fellow at Queen Mary College, University of London.

(See a Problem?)

Anthony Hilton's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS (1967) (372)
Regular Graphs of High Degree are 1‐Factorizable (1985) (87)
Star multigraphs with three vertices of maximum degree (1986) (83)
Hamiltonian decompositions of complete graphs (1984) (72)
1-factorizing Regular Graphs of High Degree - an Improved Bound (1989) (63)
Embedding Partial Steiner Triple Systems (1980) (59)
Hamiltonian decompositions of complete regular s-partite graphs (1986) (55)
A sufficient condition for equitable edge-colourings of simple graphs (1994) (55)
An Intersection Theorem for a Collection of Families of Subsets of a Finite Set (1977) (51)
A (<5)-Colour Theorem for Planar Graphs (1973) (50)
A THEOREM ON FINITE SETS (1976) (45)
The Edge-Chromatic Class of Graphs with Maximum Degree at Least |V| – 3 (1988) (40)
Existence Theorems for Sperner Families (1974) (39)
Generalized latin rectangles II: Embedding (1991) (39)
The total chromatic number of graphs having large maximum degree (1993) (36)
THANK EVANS ! (1983) (34)
Generalized Latin rectangles I: Construction and decomposition (1980) (33)
Some refinements of the total chromatic number conjecture. (1988) (32)
The reconstruction of latin squares with applications to school timetabling and to experimental design (1980) (31)
Some Results on the Oberwolfach Problem (2001) (30)
Two conjectures on edge-colouring (1989) (29)
The chromatic index of graphs of even order with many edges (1984) (27)
Embedding an Incomplete Diagonal Latin Square in a Complete Diagonal Latin Square (1973) (25)
A total-chromatic number analogue of plantholt's theorem (1990) (25)
The chromatic index of a graph whose core has maximum degree two (1992) (25)
Colouring the Edges of a Multigraph so that Each Vertex has at Most j, or at Least j, Edges of Each Colour on it (1975) (24)
On Double Diagonal and Cross Latin Squares (1973) (23)
The Hall Number, the Hall Index, and the Total Hall Number of a Graph (1999) (23)
A Solution to the Embedding Problem for Partial Idempotent Latin Squares (1982) (23)
The chromatic index of graphs with large maximum degree, where the number of vertices of maximum degree is relatively small (1990) (22)
The Total Chromatic Number of Graphs of High Minimum Degree (1991) (22)
A Graph-theoretical Generalization of Berge’s Analogue of the Erdős-Ko-Rado Theorem (2006) (21)
Extending the disjoint-representatives theorems of Hall, Halmos, and Vaughan to list-multicolorings of graphs (2000) (21)
Outlines of Latin Squares (1987) (21)
Canonical edge-colourings of locally finite graphs (1982) (21)
Graphs which are vertex-critical with respect to the edge-chromatic number (1987) (20)
Factorizations of regular graphs of high degree (1985) (19)
A generalization of Sperner's theorem (1981) (19)
Amalgamations of connected k-factorizations (2003) (19)
Critical star multigraphs (1986) (19)
Relations among the fractional chromatic, choice, Hall, and Hall-condition numbers of simple graphs (2001) (18)
The embedding of partial triple systems when 4 divides lambda (1990) (18)
(r, R+1)-factorizations of (d, D+1)-graphs (2008) (18)
THE ERDÖS–KO–RADO THEOREM WITH VALENCY CONDITIONS (1986) (17)
A generalization of Talbot's theorem about King Arthur and his Knights of the Round Table (2009) (17)
ERDÖS ON GRAPHS: HIS LEGACY OF UNSOLVED PROBLEMS (1999) (16)
Embedding Incomplete Latin Squares in Latin Squares Whose Diagonal is Almost Completely Prescribed (1980) (16)
The chromatic index of graphs with at most four vertices of maximum degree. (1984) (15)
Recent progress on edge-colouring graphs (1987) (14)
A Delta-subgraph condition for a graph to be class 1 (1989) (13)
KING ARTHUR AND HIS KNIGHTS WITH TWO ROUND TABLES (2011) (13)
On Steiner and Similar Triple Systems. (1969) (13)
Embedding Incomplete Latin Rectangles (1982) (12)
Recent results on the total chromatic number (1993) (11)
Some Results on Sperner Families (1979) (11)
Alternating hamiltonian cycles in two colored complete bipartite graphs (1992) (11)
On the maximum number of pairwise compatible euler cycles (1990) (10)
A simple proof of the Kruskal-Katona theorem and of some associated binomial inequalities (1979) (10)
A sufficient condition for a regular graph to be class 1 (1993) (10)
Partial-edge colouring of complete graphs or of graphs which are nearly complete. (1984) (10)
On the Spectra of Certain Types of Latin Square (1975) (10)
Aspects of edge list-colourings (2001) (9)
Cycle decompositions of the complete graph (2006) (9)
Symmetric Latin square and complete graph analogues of the Evans conjecture (1994) (9)
How to colour the lines of a bigraph (1974) (9)
On the Delta-subgraph of graphs which are critical with respect to the chromatic index (1989) (9)
Hamiltonian double latin squares (2003) (9)
Doubly diagonal orthogonal latin squares (1983) (8)
Fractional latin squares, simplex algebras, and generalized quotients (2000) (8)
The total chromatic number of nearly complete bipartite graphs (1991) (8)
Graphs which are vertex-critical with respect to the edge-chromatic class (1989) (8)
Completing partial latin squares: Cropper's question (2011) (8)
Outline and Amalgamated Triple Systems of Even Index (2002) (8)
The domination number of cubic Hamiltonian graphs (2005) (8)
Small Embeddings of Incomplete Idempotent Latin Squares (1983) (8)
Semiregular factorization of simple graphs (2006) (8)
The edge-chromatic class of regular graphs of degree 4 and their complements (1987) (7)
Exactly k-to-1 maps between graphs (1992) (7)
The number of points on an algebraic curve over a finite field (2007) (7)
Trees that admit 3-to-1 maps onto the circle (1990) (7)
On the Szamkolowicz‐Doyen Classification of Steiner Triple Systems (1977) (7)
Totally critical graphs and the conformability conjecture (1999) (6)
Snarks and k-snarks. (1988) (6)
The Overfull Conjecture and the Conformability Conjecture (2001) (6)
A note concerning the chromatic index of multigraphs (1987) (6)
A further construction of double diagonal orthogonal latin squares (1974) (6)
Remarks on Sade's Disproof of the Euler Conjecture with an Application to Latin Squares Orthogonal to Their Transpose (1975) (5)
A Simplification of Moore's Proof of the Existence of Steiner Triple Systems (1972) (5)
A Vertex-Splitting Lemma, de Werra's Theorem, and Improper List Colourings (1998) (5)
Progress on the Hall-Number-Two problem (2000) (5)
A Sufficient Condition for a Graph to be the Core of a Class 2 Graph (2000) (5)
Latin Squares with Prescribed Diagonals (1982) (5)
The existence of k-to-1 continuous maps between graphs when k is sufficiently large (1993) (5)
List multicolorings of graphs with measurable sets (2007) (5)
ANALOGUES OF A THEOREM OF ERDÖS, KO, AND RADO ON A FAMILY OF FINITE SETS (1974) (5)
Partitioning the edges of a graph (1978) (5)
Vertex-splitting and Chromatic Index Critical Graphs (1997) (5)
Hall parameters of complete and complete bipartite graphs (2002) (5)
Edge-Colouring Regular Bipartite Graphs (1982) (5)
Alternating Hamiltonian circuits in edge-coloured bipartite graphs (1992) (5)
The total chromatic number of regular graphs whose complement is bipartite (1994) (5)
Edge‐Colorings of Graphs: A Progress Report (1989) (5)
The Existence of Symmetric Latin Squares with One Prescribed Symbol in each Row and Column (1987) (4)
ON THE PARTITION OF HORADAM'S GENERALIZED SEQUENCES INTO GENERALIZED FIBONACCI AND GENERALIZED LUCAS SEQUENCES (2010) (4)
Totally Critical Even Order Graphs (1999) (4)
Amalgamated Factorizations of Complete Graphs (1994) (4)
A generalization of plantholt's theorem (1986) (4)
On the number of (r,r+1)- factors in an (r,r+1)-factorization of a simple graph (2009) (4)
Cropper's question and Cruse's theorem about partial Latin squares (2011) (4)
Outline symmetric latin squares (1991) (4)
An algorithm for finding factorizations of complete graphs (2003) (4)
Surveys in Combinatorics 2007 (2007) (4)
Hall's theorem and extending partial latinized rectangles (2015) (4)
Degree-bounded factorizations of bipartite multigraphs and of pseudographs (2010) (3)
An application of Tutte's Theorem to 1-factorization of regular graphs of high degree (2009) (3)
On the number of (r,r+1)‐ factors in an (r,r+1)‐factorization of a simple graph (2009) (3)
Weighted quasigroups (1993) (3)
Class 1 graphs associated with regular graphs of high degree (2002) (3)
Pairings from Down-Sets and Up-Sets in Distributive Lattices (1983) (3)
Amalgamating infinite latin squares (2005) (3)
Hall's Condition for Partial Latin Squares (2011) (3)
The total chromatic numbers of joins of sparse graphs (2003) (3)
Triangulations of 3-way regular tripartite graphs of degree 4, with applications to orthogonal latin squares (1997) (3)
An analogue of Ryser's Theorem for partial Sudoku squares (2011) (3)
On ordered set systems and some conjectures related to the erdös–ko–rado theorem and turán's theorem (1981) (3)
SIMULTANEOUSLY DISJOINT PAIRS OF SUBSETS OF A FINITE SET (1973) (3)
The pseudograph (r, s, a, t)-threshold number (2016) (2)
Non-conformable subgraphs of non-conformable graphs (2002) (2)
INTERSECTING AND NON-UNION ANTICHAINS (1994) (2)
r-Regular, r-connected decompositions of complete graphs (2000) (2)
Reverse class critical multigraphs (1988) (2)
Further remarks on partitioning the edges of a graph (1978) (2)
Amalgamations of factorizations of complete equipartite graphs (2004) (2)
Further results concerning p-quasigroups and complete graph decompositions (1976) (2)
Continuous k-to-1 functions between complete graphs of even order (2010) (2)
Some intersection and union theorems for several families of finite sets (1978) (2)
Graphs That Admit 3-to-1 or 2-to-1 Maps onto the Circle (1996) (2)
The simple graph threshold number σ ( r , s , a , t ) (1)
Completing an Edge‐Colouring of K2m with Kr and Independent Edges Precoloured (2004) (1)
On the Minimum Number of Sets Comparable with Some Members of a Set of Finite Sets (1977) (1)
Embedding incomplete double diagonal Latin squares (1975) (1)
Coloring graphs which have equibipartite complements (1997) (1)
The structure of second order sequences in a finite field. (1974) (1)
At most k-to-1 mappings between graphs, II (1996) (1)
Two sufficient conditions for a graph to be type 1 (2005) (1)
Dimension in Steiner Triple Systems (1980) (1)
Extending Edge‐Colorings of Complete Graphs and Independent Edges a (1989) (1)
Ordering classes of matrices of 0's and 1's (2007) (1)
Continuous k‐to‐1 functions between complete graphs whose orders are of a different parity (2010) (1)
List multicoloring problems involving the k-fold Hall numbers (2010) (1)
Outline and nearly outline triple systems of even index (2002) (1)
Semiregular factorizations of regular multigraphs (2010) (1)
the total Hall (1999) (0)
Partial latin squares , partial gerechte designs , list colouring and Hall ’ s condition (2017) (0)
The structure of totally critical graphs of odd order (2003) (0)
Conditions of contracts and specifications as they relate to liability (2008) (0)
On Completing Partial Latin Squares with Prescribed Diagonals (2022) (0)
On the intricacy of combinatorial construction problems. (1984) (0)
An algorithm for finding l -edge-connected k-factorizations of complete graphs (2003) (0)
Bounds Related to The Edge-List Chromatic and Total Chromatic Numbers of a Simple Graph (2020) (0)
Combinatorics: A note on embedding latin rectangles (1974) (0)
An Intersection/Union Theorem for several Families of Finite Sets (2017) (0)
Wiggles and Finitely Discontinuous k‐to‐1 Functions Between Graphs (2013) (0)
Disconnection numbers, pizza cuts, and cycle rank (1995) (0)
How Intricate are (2s + 1)-Factorizations? (1987) (0)
Several families with incomparability and complementarity conditions (2019) (0)
Continuous k-to-1 functions between complete graphs whose orders are of a different parity (2010) (0)
List multicoloring problems involving the k‐fold Hall numbers (2010) (0)
Transactions of the American Mathematical Society Exactly Rv-to-1 Maps between Graphs (2009) (0)
Surveys in Combinatorics 2007: Preface (2007) (0)
The k -fold list coloring of cycles with Hall's condition (2008) (0)
The simple graph threshold number $\sigma(r,s,a,t)$. (2019) (0)
Coloring graphs with have equibipartite complements (1997) (0)
Combinatorics, Geometry and Probability: Amalgamated Factorizations of Complete Graphs (1997) (0)
The existence of multigraphs with a given degree sequence and given chromatic index. (1988) (0)

This paper list is powered by the following services:

Other Resources About Anthony Hilton

en.wikipedia.org

What Schools Are Affiliated With Anthony Hilton?

Anthony Hilton is affiliated with the following schools: