Proof of a Packing Conjecture of Bollobás

Combinatorics, Probability and Computing

Volumn 4, Issue 3, 1995, Pages 241-255

  Komlós, János ^a   Sárközy, Gábor N ^a   Szemerédi, Endre ^a  

^a INSTITUTE OF EXPERIMENTAL MEDICINE   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84974181285     PISSN: 09635483     EISSN: 14692163     Source Type: Journal    
DOI: 10.1017/S0963548300001620     Document Type: Article

References (9)

1. Bollobás B. (1978) Extremal Graph Theory, Academic Press, London.
2. Bollobás B. and Eldridge S. E. (1978) Packings of graphs and applications to computational complexity. J. Combinatorial Theory (B) 25 105–124.
3. Broder A., Frieze A. and Upfal E. (1992) Existence and construction of edge disjoint paths on expander graphs. Proc. 24th STOC, Victoria, BC, Canada, pp. 140–149.
4. Hajnal A. and Szemerédi E. (1970) Proof of a conjecture of Erdős. In Combinatorial Theory and its Applications: Vol. II (Erdős P., Rényi A. and Sós V.T. eds.), Colloq. Math. Soc. J. Bolyai 4, North-Holland, Amsterdam, pp. 601–623.
5. Komlós J. and Sós V. (1991) Regular subgraphs of graphs. Manuscript.
6. Lovász L. (1979) Combinatorial Problems and Exercises. Akadémiai Kiadó, Budapest.
7. Sauer N. and Spencer J. (1978) Edge disjoint placement of graphs. J. Combinatorial Theory (B) 25 295–302.
8. Szemerédi E. (1976) Regular partitions of graphs. Colloques Internationaux C.N.R.S. No. 260 – Problèmes Combinatoires et Théorie des Graphes, Orsay, France, pp. 399–401.
9. Szemerédi E. (1975) On a set containing no k elements in arithmetic progression. Acta Arithmetica XXVII 199–245.