Cycle packing
<p>In the 1960s, Erdős and Gallai conjectured that the edge set of every graph on <i>n</i> vertices can be partitioned into <i>O</i>(<i>n</i>) cycles and edges. They observed that one can easily get an <i>O</i>(<i>n</i> log <i>...
主要な著者: | Conlon, D, Fox, J, Sudakov, B |
---|---|
フォーマット: | Journal article |
出版事項: |
Wiley
2014
|
類似資料
-
Cycle packing
著者:: Conlon, David, 等
出版事項: (2015) -
The regularity method for graphs with few 4‐cycles
著者:: Conlon, David, 等
出版事項: (2022) -
On two problems in graph Ramsey theory
著者:: Conlon, D, 等
出版事項: (2012) -
Short proofs of some extremal results II
著者:: Conlon, D, 等
出版事項: (2015) -
Tower-type bounds for unavoidable patterns in words
著者:: Conlon, D, 等
出版事項: (2019)