Skip to main content
SpringerLink
Log in

On Some Hypergraph Problems of Paul Erdős and the Asymptotics of Matchings, Covers and Colorings

  • Chapter
  • First Online:
The Mathematics of Paul Erdős I

  • 2246 Accesses

Abstract

This article summarizes progress on several old hypergraph problems of Paul Erdős and a few questions to which they led. Quite unexpectedly, there turned out to be substantial connections between the problems under discussion, surely some indication (if any were needed) that Erdős’ questions were the “right” ones. Here’s a quick synopsis.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. M. Ajtai, J. Komlós and E. Szemerédi, A dense infinite Sidon sequence, Europ. J. Combinatorics 2 (1981), 1–11.

    Google Scholar 

  2. M. Ajtai, J. Komlós and E. Szemerédi, A note on Ramsey numbers, J. Combinatorial Th. (A) 299 (1980), 354–360.

    Google Scholar 

  3. N. Alon, Restricted colorings of graphs, Surveys in Combinatorics, 1993 (Proc. 14th British Combinatorial Conf.), Cambridge Univ. Press, Cambridge, 1993.

    Google Scholar 

  4. N. Alon and J. H. Spencer, The Probabilistic Method, Wiley, New York, 1992.

    MATH  Google Scholar 

  5. N. Alon and M. Tarsi, Colorings and orientations of graphs, Combinatorica 12 (1992), 125–134.

    Google Scholar 

  6. L.D. Andersen, On edge-colourings of graphs, Math. Scand. 40 (1977), 161–175.

    Google Scholar 

  7. K. Azuma, Weighted sums of certain dependent random variables, Tokuku Math. J. 19 (1967), 357–367.

    Google Scholar 

  8. E. A. Bender and E. R. Canfield, The asymptotic number of labelled graphs with given degree sequences, J. Combinatorial Th. (A) 24 (1978), 296–307.

    Google Scholar 

  9. C. Berge, Hypergraphs: Combinatorics of Finite Sets, North Holland, Amsterdam, 1989.

    MATH  Google Scholar 

  10. C. Berge, On the chromatic index of a linear hypergraph and the Chvátal conjecture, pp. 40–44 in Combinatorial Mathematics: Proc. 3rd Int’l. Conf (New York, 1985), Ann. N. Y. Acad. Sci. 555, New York Acad. Sci., New York, 1989.

    Google Scholar 

  11. A. Blokhuis, More on maximal intersecting families of finite sets, J. Combinatorial Th. (A) 44 (1987), 299–303.

    Google Scholar 

  12. B. Bollobás, A probabilistic proof of an asymptotic formula for the number of regular graphs, Europ. J. Combinatorics 1 (1980), 311–316.

    Google Scholar 

  13. B. Bollobás, The independence ratio of regular graphs, Proc. Amer. Math. Soc. 83 (1981), 433–436.

    Google Scholar 

  14. B. Bollobás, Martingales, isoperimetric inequalities and random graphs, in Combinatories, A. Hajnal, L. Lovász and V.T. Sós Eds., Colloq. Math. Soc. János Bolyai 52, North Holland, 1988.

    Google Scholar 

  15. B. Bollobás and A. J. Harris, List-colourings of graphs, Graphs and Combinatorics 1 (1985), 115–127.

    Google Scholar 

  16. B. Bollobás and H. Hind, A new upper bound for the list chromatic number, Discrete Math. 74 (1989), 65–75.

    Google Scholar 

  17. V. Boltjansky and I. Gohberg, Results and Problems in Combinatorial Geometry, Cambridge University Press, Cambridge, 1985.

    Book  MATH  Google Scholar 

  18. E. Boros, Z. Füredi and J. Kahn, Maximal intersecting families and affine regular polygons, J. Combinatorial Th. (A) 52 (1989), 1–9.

    Google Scholar 

  19. K. Borsuk, Drei Sätze über die n-dimensionale euklidische Sphäre, Fundamenta Math. 20 (1933), 177–190.

    Google Scholar 

  20. N. G. de Bruijn and P. Erdős, A combinatorial problem, Indagationes Math. 8 (1946), 461–467.

    Google Scholar 

  21. W. I. Chang and E. Lawler, Edge coloring of hypergraphs and a conjecture of Erdős, Faber, Lovász, Combinatorica 8 (1989), 293–295.

    Google Scholar 

  22. A. Chetwynd and R. Häggkvist, A note on list-colorings, J. Graph Th. 13 (1989), 87–95.

    Google Scholar 

  23. S. Chowla, P. Erdős and E. Straus, On the maximal number of pairwise orthogonal Latin squares of a given order, Can. J. Math. 12 (1960), 204–208.

    Article  MATH  Google Scholar 

  24. H. Croft, K. Falconer and R. Guy, Unsolved Problems in Geometry, Springer-Verlag, New York, 1991.

    Book  MATH  Google Scholar 

  25. S. J. Dow, C. A. Drake, Z. Füredi and J. A. Larson, A lower bound for the cardinality of a maximal family of mutually intersecting sets of equal size, Congressus Numerantium 48 (1985), 47–48.

    Google Scholar 

  26. J. Edmonds, Maximum matching and a polyhedron with 0, 1-vertices, J. Res. Nat. Bureau of Standards (B) 69 (1965), 125–130.

    Google Scholar 

  27. M.N. Ellingham and L. Goddyn, List edge colourings of some regular 1-factorable multigraphs, Combinatorica16 (1996), 343–352.

    Google Scholar 

  28. P. Erdős, Some old and new problems in various branches of combinatorics, Congressus Numerantium 23 (1979), 19–37.

    Google Scholar 

  29. P. Erdős, On the combinatorial problems which I would most like to see solved, Combinatorica 1 (1981), 25–42.

    Google Scholar 

  30. P. Erdős, My Scottish book “problems”, pp. 35–43 in The Scottish Book. Mathematics from the Scottish Café (R.D. Mauldin, ed.), Birkhäuser, 1981.

    Google Scholar 

  31. P. Erdős, Some of my old and new combinatorial problems, pp. 35–46 in Paths, Flows and VLSI-Layout (B. Korte, L. Lovász, H.-J. Promel and A. Schrijver, eds.), Springer, Berlin, 1990.

    Google Scholar 

  32. P. Erdős and H. Hanani, On a limit theorem in combinatorial analysis, Publ. Math. Debrecen 10 (1963), 10–13.

    Google Scholar 

  33. P. Erdős and L. Lovász, Problems and results on 3-chromatic hypergraphs and some related questions, Coll. Math. Soc. J. Bolyai 10 (1974), 609–627.

    Google Scholar 

  34. P. Erdős, A. Rubin and H. Taylor, Choosability in graphs, Congressus Numerantium 26 (1979), 125–157.

    Google Scholar 

  35. S. J. Fiorini and R. J. Wilson, Edge Colourings of Graphs, Research Notes in Mathematics 16, Pitman, London, 1977.

    Google Scholar 

  36. R. A. Fisher, An examination of the different possible solutions of a problem in incomplete blocks, Ann Eugenics 10 (1940), 52–75.

    Google Scholar 

  37. H. Fleischner and M. Stiebitz, A solution to a colouring problem of P. Erdős, Disc. Math. 101 (1992), 39–48.

    Google Scholar 

  38. P. Frankl and V. Rödl, Near-perfect coverings in graphs and hypergraphs, Europ. J. Combinatorics 6 (1985), 317–326.

    Google Scholar 

  39. P. Frankl and R.M. Wilson, Intersection theorems with geometric consequences, Combinatorica 1 (1981), 357–368.

    Google Scholar 

  40. Z. Füredi, On maximal intersecting families of finite sets, J. Combinatorial Th. (A) 28 (1980), 282–289.

    Google Scholar 

  41. Z. Füredi, The chromatic index of simple hypergraphs, Graphs and Combinetorics 2 (1986), 89–92.

    Google Scholar 

  42. Z. Füredi, Matchings and covers in hypergraphs, Graphs and Combinatorics 4 (1988), 115–206.

    Google Scholar 

  43. C. D. Godsil, Matching behavior is asymptotically normal, Combinatorica 1 (1981), 369–376.

    Google Scholar 

  44. C.D. Godsil, Matchings and walks in graphs, J. Graph Th. 5 (1981), 285–297.

    Google Scholar 

  45. M. K. Goldberg, Edge-colorings of multigraphs: recoloring technique, J. Graph Th. 8 (1984), 123–127.

    Google Scholar 

  46. B. Grünbaum, Borsuk’s problem and related questions, Proc. Symp. Pure Math. 7 (Convexity), Amer. Math. Soc., 1963.

    Google Scholar 

  47. R. Häggkvist and A. Chetwynd, Some upper bounds on the total and list chromatic numbers of multigraphs, J. Graph Th. 16 (1992), 503–516.

    Google Scholar 

  48. R. Häggkvist and J. C. M. Janssen, On the list-chromatic index of bipartite graphs, manuscript, 1993.

    Google Scholar 

  49. L.H. Harper, Stirling behavior is asymptotically normal, Ann. Math. Stat. 38 (1967), 410–414.

    Google Scholar 

  50. O. J. Heilmann and E.H. Lieb, Monomers and dimers, Phys. Rev. Letters 24 (1970), 1412–1414.

    Google Scholar 

  51. O.J. Heilmann and E.H. Lieb, Theory of monomer-dimer systems, Comm. Math. Physics 25 (1972), 190–232.

    Google Scholar 

  52. H.R. Hind, Restricted edge-colourings, Doctoral thesis, Peterhouse College, Cambridge, 1988.

    Google Scholar 

  53. N. Hindman, On a conjecture of Erdős, Faber and Lovász about n-colorings, Canadian J. Math. 33 (1981), 563–570.

    Google Scholar 

  54. W. Hoeffding, Probability inequalities for sums of bounded random variables. J. Amer. Stat. Assoc. 27 (1963), 13–30.

    Google Scholar 

  55. R. Huang and G.-C. Rota, On the relations of various conjectures on Latin squares and straightening coefficients, manuscript, 1993.

    Google Scholar 

  56. J.C.M. Janssen, The Dinitz problem solved for rectangles, Bull. Amer. Math. Soc. 29 (1993), 243–249.

    Google Scholar 

  57. J. Kahn, On a theorem of Frankl and Rödl, in preparation.

    Google Scholar 

  58. J. Kahn, Coloring nearly-disjoint hypergraphs with n + o(n) colors, J. Combinatorial Th. (A) 59 (1992), 31–39.

    Google Scholar 

  59. J. Kahn, On a problem of Erdős and Lovász: random lines in a projective plane, Combinatorica 12 (1992), 417–423.

    Google Scholar 

  60. J. Kahn, Recent results on some not-so-recent hypergraph matching and covering problems, pp. 305–353 in Extremal Problems for Finite Sets, Visegrád, 1991, Bolyai Soc. Math. Studies 3, 1994.

    Google Scholar 

  61. J. Kahn, On a problem of Erdős and Lovász II: n(r) = O(r), J. Amer. Math. Soc. 7 (1994), 125–143.

    Google Scholar 

  62. J. Kahn, Asymptotically good list-colorings, J. Combinatorial Th. (A), 73 (1996), 1–59.

    Article  MathSciNet  MATH  Google Scholar 

  63. J. Kahn, A normal law for matchings, Combinatorica 20 (2000), 339–391.

    Google Scholar 

  64. J. Kahn and G. Kalai, A problem of Füredi and Seymour on covering intersecting families by pairs, J. Combinatorial Th. 68 (1994), 317–339.

    Article  MathSciNet  MATH  Google Scholar 

  65. J. Kahn and G. Kalai, A counterexample to Borsuk’s Conjecture, Bull. Amer. Math. Soc. 29 (1993), 60–62.

    Google Scholar 

  66. J. Kahn and M. Kayll, Fractional vs. integral covers in hypergraphs of bounded edge size, J. Combinatorial Th. A 78 (1997), 199–235.

    Google Scholar 

  67. J. Kahn and J.H. Kim, Random matchings in regular graphs, Combinatorica 18 (1998), 201–226.

    Google Scholar 

  68. J. Kahn and P. D. Seymour, A fractional version of the Erdős-Faber-Lovász Conjecture, Combinatorica 12 (1992), 155–160.

    Google Scholar 

  69. J. H. Kim, On Brooks’ Theorem for sparse graphs, Combinatorics, Probability and Computing 4 (1995), 97–132.

    Google Scholar 

  70. J. Komlós, J. Pintz and E. Szemerédi, A lower bound for Heilbronn’s problem, J. London Math. Soc. 25 (1982), 13–24.

    Google Scholar 

  71. A. V. Kostochka, Degree, girth and chromatic number, pp. 679–696 in Combinatorics, Keszthely 1976, A. Hajnal and V. T. Sós Eds., Colloq. Math. Soc. János Bolyai 18, North Holland, 1978.

    Google Scholar 

  72. H. Kunz, Location of the zeros of the partition function for some classical lattice systems, Phys. Lett. (A) (1970), 311–312.

    Google Scholar 

  73. D. G. Larman, in Convexity and Graph Theory (Rosenfeld and Zaks, eds.), Ann. Discrete Math. 20 (1984), 336.

    Google Scholar 

  74. L. Lovász and M.D. Plummer, Matching Theory, North Holland, Amsterdam, 1986.

    MATH  Google Scholar 

  75. C.J.H. McDiarmid, On the method of bounded differences, pp. 148–188 in Surveys in Combinatorics 1989, Invited Papers at the 12th British Combinatorial Conference, J. Siemons Ed., Cambridge Univ. Pr., 1989.

    Google Scholar 

  76. J.-C. Meyer, pp. 285–286 in Hypergraph Seminar (Berge and Ray-Chaudhuri, eds.), Springer, Berlin-Heidelberg-New York, 1974.

    Google Scholar 

  77. N. Pippenger and J. Spencer, Asymptotic behavior of the chromatic index for hypergraphs, J. Combinatorial Th. (A) 51 (1989), 24–42.

    Google Scholar 

  78. Y. Rabinovich, A. Sinclair and A. Wigderson, Quadratic Dynamical Systems, Proc. 33rd IEEE Symposium on Foundations of Computer Science (1992), 304–313.

    Google Scholar 

  79. J. Riordan, An Introduction to Combinatorial Analysis, Wiley, New York, 1958.

    MATH  Google Scholar 

  80. V. Rödl, On a packing and covering problem, Europ. J. Combinatorics 5 (1985), 69–78.

    Google Scholar 

  81. A. Ruciński, The behaviour of \(\left ({ n \atop k,,\ldots,,k,n-ik} \right ){c}^{i}/i!\) is asymptotically normal, Discrete Math. 49 (1984), 287–290.

    Google Scholar 

  82. A. Schrijver, Theory of Linear and Integer Programming, Wiley, Chichester, 1986.

    MATH  Google Scholar 

  83. P. D. Seymour, Some unsolved problems on one-factorizations of graphs, in Graph Theory and Related Topics (Bondy and Murty, eds.), Academic Press, New York, 1979.

    Google Scholar 

  84. P. D. Seymour, Packing nearly-disjoint sets, Combinatorica 2 (1982), 91–97.

    Google Scholar 

  85. C. E. Shannon, A theorem on coloring the lines of a network, J. Math. Phys. 28 (1949), 148–151.

    Google Scholar 

  86. J. B. Shearer, A note on the independence number of triangle-free graphs, Discrete Math. 46 (1983), 83–87.

    Article  MathSciNet  MATH  Google Scholar 

  87. J. Spencer, Lecture notes, M.I.T., 1987.

    Google Scholar 

  88. J. Spencer, personal communication.

    Google Scholar 

  89. B. Toft, 75 graph-colouring problems, pp. 9–35 in Graph Colourings (R. Nelson and R.J. Wilson, eds.), Wiley, New York, 1990.

    Google Scholar 

  90. V. G. Vizing, On an estimate of the chromatic class of a p-graph (in Russian), Diskret. Analiz 3 (1964), 25–30.

    Google Scholar 

  91. V. G. Vizing, Some unsolved problems in graph theory (Russian), Uspehi Mat. Nauk. 23 (1968), 117–134. English translation in Russian Math. Surveys 23 (1968), 125–141.

    Google Scholar 

  92. V. G. Vizing, Coloring the vertices of a graph in prescribed colors (in Russian), Diskret. Analiz No 29 Metody Diskret. Anal. v Teorii Kodov i Shem (1976), 3–10, 101 (MR58 #16371).

    Google Scholar 

  93. R. M. Wilson, An existence theory for pairwise balanced designs I–III, J. Combinatorial Th. (A) 13 (1972), 220–273, 18 (1975), 71–79.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and RUTCOR, Rutgers University, New Brunswick, NJ, 08903, USA

    Jeff Kahn

Authors
  1. Jeff Kahn
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jeff Kahn .

Editor information

Editors and Affiliations

  1. Dept. Comp. Sci. & Engineering, University of California, San Diego, La Jolla, California, USA

    Ronald L. Graham

  2. Department of Applied Mathematics, Charles University Department of Applied Mathematics, Prague, Czech Republic

    Jaroslav Nešetřil

  3. Department of Mathematics, Iowa State University, Ames, Iowa, USA

    Steve Butler

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer Science+Business Media New York

About this chapter

Cite this chapter

Kahn, J. (2013). On Some Hypergraph Problems of Paul Erdős and the Asymptotics of Matchings, Covers and Colorings. In: Graham, R., Nešetřil, J., Butler, S. (eds) The Mathematics of Paul Erdős I. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-7258-2_22

Download citation

Publish with us

Policies and ethics

Search

Navigation