| dc.contributor.author | Conlon, David | |
| dc.contributor.author | Fox, Jacob | |
| dc.contributor.author | Sudakov, Benny | |
| dc.date.accessioned | 2015-01-14T18:25:44Z | |
| dc.date.available | 2015-01-14T18:25:44Z | |
| dc.date.issued | 2014-12 | |
| dc.date.submitted | 2013-10 | |
| dc.identifier.issn | 10429832 | |
| dc.identifier.uri | http://hdl.handle.net/1721.1/92862 | |
| dc.description.abstract | In the 1960s, Erdős and Gallai conjectured that the edge set of every graph on n vertices can be partitioned into O(n) cycles and edges. They observed that one can easily get an O(nlogn) upper bound by repeatedly removing the edges of the longest cycle. We make the first progress on this problem, showing that O(nloglogn) cycles and edges suffice. We also prove the Erdős-Gallai conjecture for random graphs and for graphs with linear minimum degree. | en_US |
| dc.description.sponsorship | Royal Society (Great Britain) (University Research Fellowship) | en_US |
| dc.description.sponsorship | Simons Foundation (Fellowship) | en_US |
| dc.description.sponsorship | National Science Foundation (U.S.) (Grant NSF-DMS-1069197) | en_US |
| dc.description.sponsorship | Alfred P. Sloan Foundation (Fellowship) | en_US |
| dc.description.sponsorship | NEC Corporation (MIT NEC Corp. award) | en_US |
| dc.description.sponsorship | Swiss National Science Foundation (SNSF grant 200021-149111) | en_US |
| dc.description.sponsorship | United States-Israel Binational Science Foundation (grant) | en_US |
| dc.language.iso | en_US | |
| dc.publisher | Wiley-VCH Verlag GmbH & Co. | en_US |
| dc.relation.isversionof | http://dx.doi.org/10.1002/rsa.20574 | en_US |
| dc.rights | Creative Commons Attribution-Noncommercial-Share Alike | en_US |
| dc.rights.uri | http://creativecommons.org/licenses/by-nc-sa/4.0/ | en_US |
| dc.source | arXiv | en_US |
| dc.title | Cycle packing | en_US |
| dc.type | Article | en_US |
| dc.identifier.citation | Conlon, David, Jacob Fox, and Benny Sudakov. “Cycle Packing.” Random Struct. Alg. 45, no. 4 (October 16, 2014): 608–626. | en_US |
| dc.contributor.department | Massachusetts Institute of Technology. Department of Mathematics | en_US |
| dc.contributor.mitauthor | Fox, Jacob | en_US |
| dc.relation.journal | Random Structures & Algorithms | en_US |
| dc.eprint.version | Author's final manuscript | en_US |
| dc.type.uri | http://purl.org/eprint/type/JournalArticle | en_US |
| eprint.status | http://purl.org/eprint/status/PeerReviewed | en_US |
| dspace.orderedauthors | Conlon, David; Fox, Jacob; Sudakov, Benny | en_US |
| mit.license | OPEN_ACCESS_POLICY | en_US |
| mit.metadata.status | Complete | |
