Abstract
In this paper we obtain estimates for the least number of edges ann-uniformr-color-critical hypergraph of orderm may have.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
H. L. Abbott andL. Moser, On a combinatorial problem of ErdŐs and Hajnal,Can. Math. Bull.,7 (1964), 177–181.
H. L. Abbott andD. Hanson, On a combinatorial problem of ErdŐs,Can. Math. Bull.,12 (1969), 823–829.
H. L. Abbott andA. Liu, The existence problem for color critical linear hypergraphs,Acta Math. Acad. Sci. Hung.,32 (1978), 273–282.
H. L. Abbott, A. Liu andB. Toft, The enumeration problem for color critical linear hypergraphs,J. Comb. Theory,B29 (1980), 106–115.
H. L. Abbott and.A. Liu, On property B of families of sets,Can. Math. Bull.,23 (1980), 429–435.
P. Aizley andJ. E. Selfridge, Notices,Amer. Math., Soc.,24 (1977), A-452.
J. Beck, On 3-chromatic hypergraphs,Disc. Math.,24 (1978), 127–137.
M. I. Burstein, Critical hypergraphs with minimum number of edges,Bull. Acad. Sci. Georg.,SSR 83 (1976), 285–288 (in Russian).
H. L. de Vries, On property B and Steiner systems,Math. Zeit.,53 (1977), 155–159.
G. A. Dirac, A property of 4-chromatic graphs and some remarks on critical graphs,J. Lond. Math. Soc.,27 (1952), 85–92.
G. A. Dirac, A Theorem of R. L. Brooks and a conjecture of H. Hadwiger,Proc. Lond. Math. Soc.,17 (1957), 161–195.
P. ErdŐs, On a combinatorial problem,Nordisk. Mat. Tidskr.,11 (1963), 5–10.
P. ErdŐs, On a combinatorial problem II,Acta Math. Acad. Sci. Hung.,15 (1964), 445–447.
P. ErdŐs, On a combinatorial problem III,Can. Math. Bull.,12 (1969), 413–416.
P. ErdŐs andA. Hajnal, Chromatic numbers of graphs and set-systems,Acta Math. Acad. Sci. Hung.,17 (1966), 61–99.
P.ErdŐs and L.Lovász, Problems and results on 3-chromatic hypergraphs, inInfinite and Finite Sets ed. A. Hajnal et. al., North Holland Publishing Co.,1975, 609–627.
P. ErdŐs andH. Hanani, On a limit theorem in combinatorial analysis,Pub. Math.,10 (1963), 10–13.
F.Everts,Coloring of sets, Ph. D. Thesis, Univ of Colorado, (1977).
T. Gallai, Kritishe Graphen I,Magy. Tud. Akad. Kut. Int. Közl.,8 (1963), 165–192.
G. Hajós, über eine Konstruktion nichtn-farbharer Graphen, Wiss. Zeit. Martin Luther Univ. Halle-Wittenberg,Math.-Nat. A10 (1961), 116–117.
M. Herzog andJ. Schonheim, TheB r property and chromatic numbers of generalized graphs,J. Comb. Theory,B12 (1972), 41–49.
D. S. Johnson, On propertyB r ,J. Comb. Theory,B20 (1976), 64–66.
A.Liu, Some results on hypergraphs,Ph. D. Thesis, Univ. of Alberta, (1976).
W. M. Schmidt, Ein kombinatorsches problem von P. Erdös und A. Hajnal,Acta Math. Acad. Sci. Hung.,15 (1964), 373–374.
P. D. Seymour, A note on a combinatorial problem of Erdös and Hajnal,Bull. Lond. Math. Soc.,8 (1974), 681–682.
P. D. Seymour, On the two coloring of hypergraphs,Quart. J. Math. Oxford,25 (1974), 303–312.
J. Spencer, Coloringn-sets red and blue,J. Comb. Theory,A30 (1981), 112–113.
B.Toft, On color critical hypergraphs, inInfinite and Finite Sets, ed. A. Hajnal et. al., North Holland Publishing Co. (1975), 1445–1457.
B. Toft, Color critical graphs and hypergraphs,J. Comb. Theory,B16 (1974), 145–161.
D. R.Woodall,Property B and the four-color problem, in “Combinatorics” ed. D. J. A. Welsh and D. R. Woodall, Institute of Mathematics and its Applications, (1972), 322–340.