How tight is the Bollobás-Komlós conjecture?

Graphs and Combinatorics

Volumn 16, Issue 2, 2000, Pages 129-137

  Abbasi, Sarmad ^a  

^a QUAID I AZAM UNIVERSITY   (Pakistan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0038701319     PISSN: 09110119     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (6)

1. Abbasi, S.: Embedding low bandwidth bipartite graphs, sumbitted (1998)
2. Alon, N., Spencer, J.: The probabilistic method. New York: John Wiley 1992
3. Bollobás, B.: Graph theory. Berlin Heidelberg New York: Springer 1979
4. Komlós, J., Simonovits, M.: Szemerédi's regularity lemma and its applications in graph theory. In Paul Erdös is 80. Proc. Colloq. Math. Soc. János Bolyai, 2, 295-352 (1996)
5. Szemerédi, E.: Regular partitions of graphs. In Colloques Internationaux C.N.R.S. No 260 - Problèmes Combinatoires et Théorie des Graphes. pp 399-401 Orsay: 1976
6. Szemerédi, E.: Personal Communication (1997)