Published August 20, 2019
| Submitted
Report
Open
Large subgraphs without complete bipartite graphs
- Creators
-
Conlon, David
- Fox, Jacob
- Sudakov, Benny
Abstract
In this note, we answer the following question of Foucaud, Krivelevich and Perarnau. What is the size of the largest K_(r,s)-free subgraph one can guarantee in every graph G with m edges? We also discuss the analogous problem for hypergraphs.
Additional Information
We would like to thank M. Krivelevich for bringing this problem to our attention and for sharing with us preprint 'Large subgraphs without short cycles' by F. Foucaud, M. Krivelevich and G. Perarnau.Attached Files
Submitted - 1401.6711.pdf
Files
1401.6711.pdf
Files
(88.7 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:b9a1f374aeb1e2df03f57a98d85d2f77
|
88.7 kB | Preview Download |
Additional details
- Eprint ID
- 98020
- Resolver ID
- CaltechAUTHORS:20190819-170849884
- Created
-
2019-08-20Created from EPrint's datestamp field
- Updated
-
2023-06-02Created from EPrint's last_modified field