How tight is the Bollobás-Komlós conjecture (2000) [1 citations — 0 self]
by Sarmad Abbasi
Graphs Combin
ftp://dimacs.rutgers.edu/pub/dimacs/TechnicalReports/TechReports/1998/98-21.ps.gz
Add To MetaCart
Abstract:
The bipartite case of the Bollob'as and Koml'os conjecture states that for every \Delta 0; fl? 0 there is an ff = ff(\Delta 0; fl) ? 0 such that the following statement holds: If G is any graph with ffi(G)
Citations
| 113 | Szemeredi’s regularity lemma and its applications in graph theory – Komlos, Simonovits - 1993 |
| 86 | Regular partitions of graphs – Szemerédi - 1978 |
| 1 | On an embedding conjecture of Bollob'as and Koml'os – Abbbasi - 1998 |
