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>...
Príomhchruthaitheoirí: | Conlon, D, Fox, J, Sudakov, B |
---|---|
Formáid: | Journal article |
Foilsithe / Cruthaithe: |
Wiley
2014
|
Míreanna comhchosúla
-
Cycle packing
de réir: Conlon, David, et al.
Foilsithe / Cruthaithe: (2015) -
The regularity method for graphs with few 4‐cycles
de réir: Conlon, David, et al.
Foilsithe / Cruthaithe: (2022) -
On two problems in graph Ramsey theory
de réir: Conlon, D, et al.
Foilsithe / Cruthaithe: (2012) -
Short proofs of some extremal results II
de réir: Conlon, D, et al.
Foilsithe / Cruthaithe: (2015) -
Tower-type bounds for unavoidable patterns in words
de réir: Conlon, D, et al.
Foilsithe / Cruthaithe: (2019)