Color-Critical Graphs and Hypergraphs with Few Edges: A Survey

The current situation with bounds on the smallest number of edges in color-critical graphs and hypergraphs is discussed.

[1]  Alexandr V. Kostochka,et al.  A List Version of Dirac's Theorem on the Number of Edges in Colour-critical Graphs , 2002 .

[2]  John Mitchem.  A new proof of a theorem of Dirac on the number of edges in critical graphs. , 1978 .

[3]  A. V. Kostochka,et al.  A very short proof of Dirac's theorem on the number of edges in chromatically critical graphs , 1996 .

[4]  G. A. Dirac,et al.  A Theorem of R. L. Brooks and a Conjecture of H. Hadwiger , 1957 .

[5]  Joel H. Spencer,et al.  Coloring n-Sets Red and Blue , 1981, J. Comb. Theory, Ser. A.

[6]  Alexandr V. Kostochka,et al.  Excess in colour-critical graphs , 1999 .

[7]  Tommy R. Jensen,et al.  Graph Coloring Problems: Jensen/Graph , 1994 .

[8]  S. M. DE BACKER.  The Four-Colour Problem , 1944, Nature.

[9]  G. Dirac.  On the structure of k-chromatic graphs , 1967, Mathematical Proceedings of the Cambridge Philosophical Society.

[10]  Michael Krivelevich,et al.  An Improved Bound on the Minimal Number of Edges in Color-Critical Graphs , 1997, Electron. J. Comb..

[11]  de Ng Dick Bruijn.  A combinatorial problem , 1946 .

[12]  Zoltán Szabó.  An Application of Lovász's Local Lemma - A New Lower Bound for the van der Waerden Number , 1990, Random Struct. Algorithms.

[13]  J. Weinstein,et al.  Excess in critical graphs , 1975 .

[14]  J. Beck,et al.  On 3-chromatic hypergraphs , 1978, Discret. Math..

[15]  Michael Stiebitz.  Proof of a conjecture of T. Gallai concerning connectivity properties of colour-critical graphs , 1982, Comb..

[16]  Bing Zhou,et al.  Sparse color-critical graphs and hypergraphs with no short cycles , 1994, J. Graph Theory.

[17]  Alexandr V. Kostochka,et al.  On the Number of Edges in Colour-Critical Graphs and Hypergraphs , 2000, Comb..

[18]  P. Erdos.  On a combinatorial problem. II , 1964 .

[19]  Bing Zhou,et al.  Color-critical graphs and hypergraphs with few edges and no short cycles , 1998, Discrete Mathematics.

[20]  L. Lovász.  A generalization of Kónig's theorem , 1970 .

[21]  N. Alon.  Restricted colorings of graphs , 1993 .

[22]  Alexandr V. Kostochka,et al.  Properties of Descartes' Construction of Triangle-Free Graphs with High Chromatic Number , 1999, Combinatorics, Probability and Computing.

[23]  Michael Stiebitz,et al.  On constructive methods in the theory of colour-critical graphs , 1989, Discret. Math..

[24]  Vojtech Rödl,et al.  Note on Independent Sets in Steiner Systems , 1994, Random Struct. Algorithms.

[25]  B. Toft.  Colouring, stable sets and perfect graphs , 1996 .

[26]  P. Erdos-L Lovász.  Problems and Results on 3-chromatic Hypergraphs and Some Related Questions , 2022 .

[27]  Van H. Vu,et al.  A General Upper Bound on the List Chromatic Number of Locally Sparse Graphs , 2002, Combinatorics, Probability and Computing.

[28]  Alexandr V. Kostochka,et al.  On the Number of Edges in Hypergraphs Critical with Respect to Strong Colourings , 2000, Eur. J. Comb..

[29]  H. L. Abbott,et al.  Sparse color-critical hypergraphs , 1989, Comb..

[30]  Aravind Srinivasan,et al.  Improved bounds and algorithms for hypergraph two-coloring , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[31]  Keith Walker.  Surveys in combinatorics, 1993 , 1993 .

[32]  P. Seymour.  ON THE TWO-COLOURING OF HYPERGRAPHS , 1974 .

[33]  John Mitchem,et al.  On Dirac's Generalization of Brooks' Theorem , 1972, Canadian Journal of Mathematics.

[34]  G. A. Dirac,et al.  Note on the colouring of graphs , 1951 .

[35]  Tommy R. Jensen,et al.  Graph Coloring Problems , 1994 .

[36]  Alexandr V. Kostochka,et al.  A new lower bound on the number of edges in colour-critical graphs and hypergraphs , 2003, J. Comb. Theory, Ser. B.

[37]  Noga Alon,et al.  Choice Numbers of Graphs: a Probabilistic Approach , 1992, Combinatorics, Probability and Computing.

[38]  Seiya Negami,et al.  Chromatic numbers of quadrangulations on closed surfaces , 2001, J. Graph Theory.

[39]  G. Dirac,et al.  The number of edges in critical graphs. , 1974 .

[40]  A. P. Domoryad.  The Four-Colour Problem , 1963 .

[41]  Andras Hajnal,et al.  On a property of families of sets , 1964 .

[42]  Ethan D. Bloch.  Infinite and Finite Sets , 2003 .

[43]  Michael Krivelevich.  An improved bound on the minimal number of edges in color-critical graphs , 1997 .

[44]  Atsuhiro Nakamoto,et al.  Fractional chromatic numbers of cones over graphs , 2001 .

[45]  Vojtech Rödl,et al.  The minimum independence number for designs , 1995, Comb..

[46]  Bjarne Toft,et al.  Color-critical graphs and hypergraphs☆ , 1974 .

[47]  Aravind Srinivasan,et al.  Improved bounds and algorithms for hypergraph 2-coloring , 2000, Random Struct. Algorithms.

[48]  Noga Alon,et al.  Hypergraphs with high chromatic number , 1985, Graphs Comb..

[49]  Alexandr V. Kostochka,et al.  Coloring uniform hypergraphs with few colors , 2004, Random Struct. Algorithms.

[50]  Alexandr V. Kostochka,et al.  Density Conditions for Panchromatic Colourings of Hypergraphs , 2001, Comb..

[51]  R. Graham,et al.  Handbook of Combinatorics , 1995 .

[52]  Vojtech Rödl,et al.  On the chromatic number of set systems , 2001, Random Struct. Algorithms.