Proof of a conjecture of Bollobás and Eldridge for graphs of maximum degree three

Combinatorica

Volumn 23, Issue 1, 2003, Pages 35-72

  Csaba, Béla ^a   Shokoufandeh, Ali ^b   Szemerédi, Endre ^c  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b Drexel University   (United States)

^c RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0038043551     PISSN: 02099683     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00493-003-0013-4     Document Type: Article

References (10)

1. S. ABBASI: Spanning subgraphs of dense graphs and a combinatorial problem on strings, PhD thesis, 1998, Rutgers University.
2. S. ABBASI: Decomposition Theorem, in preparation.
3. M. AIGNER and S. BRANDT: Embedding arbitrary graphs of maximum degree two, J. London Math. Soc., 48 (1993) 39-51.
4. N. ALON and E. FISCHER: 2-factors in dense graphs, Discrete Math., 152 (1996), 13-23.
5. B. BOLLOBÁS and S.E. ELDRIDGE: Packing of Graphs and Applications to Computational Complexity, Journal of Combinatorial Theory, Series B 25 (1978), 105-124.
6. H. CORRÁDI and A. HAJNAL: On the Maximal Number of Independent Circuits in a Graph, Acta Math. Hung., 14 (1963), 423-439.
7. A. HAJNAL and E. SZEMERẂDI: Proof of a Conjecture of Erdos, in Combinatorial Theory and Its Applications, II (P. Erdos, and V. T. Sós, Eds.), Colloquia Mathematica Societatis János Bolyai, North-Holland, Amsterdam/London, 1970.
8. J. KOMLÓS, G.N. SÁRKÖZY and E. SZEMERÉDI: An Algorithmic Version of the Blowup Lemma, Random Struct. Alg., 12 (1998), 297-312.
9. J. KOMLÓS and M. SIMONOVITS: Szemerédi's Regularity Lemma and its Applications in Graph Theory, Combinatorics, Paul Erdos is eighty, Vol. 2 (Keszthely, 1993), 295-352.
10. E. SZEMERÉDI: Regular Partitions of Graphs, in: Problèmes Comminatoires et Théorie des Graphes, Colloques Internationaux C.N.R.S., 260 (1976), 399-401.