Matches in SemOpenAlex for { <https://semopenalex.org/work/W4297805244> ?p ?o ?g. }
Showing items 1 to 59 of
59
with 100 items per page.
- W4297805244 abstract "In the 1960s, ErdH{o}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(n log n) upper bound by repeatedly removing the edges of the longest cycle. We make the first progress on this problem, showing that O(n log log n) cycles and edges suffice. We also prove the ErdH{o}s-Gallai conjecture for random graphs and for graphs with linear minimum degree." @default.
- W4297805244 created "2022-10-01" @default.
- W4297805244 creator A5006789469 @default.
- W4297805244 creator A5042722711 @default.
- W4297805244 creator A5066741544 @default.
- W4297805244 date "2013-10-02" @default.
- W4297805244 modified "2023-09-26" @default.
- W4297805244 title "Cycle packing" @default.
- W4297805244 doi "https://doi.org/10.48550/arxiv.1310.0632" @default.
- W4297805244 hasPublicationYear "2013" @default.
- W4297805244 type Work @default.
- W4297805244 citedByCount "0" @default.
- W4297805244 crossrefType "posted-content" @default.
- W4297805244 hasAuthorship W4297805244A5006789469 @default.
- W4297805244 hasAuthorship W4297805244A5042722711 @default.
- W4297805244 hasAuthorship W4297805244A5066741544 @default.
- W4297805244 hasBestOaLocation W42978052441 @default.
- W4297805244 hasConcept C114614502 @default.
- W4297805244 hasConcept C118615104 @default.
- W4297805244 hasConcept C132525143 @default.
- W4297805244 hasConcept C134306372 @default.
- W4297805244 hasConcept C162307627 @default.
- W4297805244 hasConcept C177264268 @default.
- W4297805244 hasConcept C199360897 @default.
- W4297805244 hasConcept C2780990831 @default.
- W4297805244 hasConcept C33923547 @default.
- W4297805244 hasConcept C41008148 @default.
- W4297805244 hasConcept C63553672 @default.
- W4297805244 hasConcept C76155785 @default.
- W4297805244 hasConcept C77553402 @default.
- W4297805244 hasConceptScore W4297805244C114614502 @default.
- W4297805244 hasConceptScore W4297805244C118615104 @default.
- W4297805244 hasConceptScore W4297805244C132525143 @default.
- W4297805244 hasConceptScore W4297805244C134306372 @default.
- W4297805244 hasConceptScore W4297805244C162307627 @default.
- W4297805244 hasConceptScore W4297805244C177264268 @default.
- W4297805244 hasConceptScore W4297805244C199360897 @default.
- W4297805244 hasConceptScore W4297805244C2780990831 @default.
- W4297805244 hasConceptScore W4297805244C33923547 @default.
- W4297805244 hasConceptScore W4297805244C41008148 @default.
- W4297805244 hasConceptScore W4297805244C63553672 @default.
- W4297805244 hasConceptScore W4297805244C76155785 @default.
- W4297805244 hasConceptScore W4297805244C77553402 @default.
- W4297805244 hasLocation W42978052441 @default.
- W4297805244 hasOpenAccess W4297805244 @default.
- W4297805244 hasPrimaryLocation W42978052441 @default.
- W4297805244 hasRelatedWork W2004634617 @default.
- W4297805244 hasRelatedWork W2077251859 @default.
- W4297805244 hasRelatedWork W2229409480 @default.
- W4297805244 hasRelatedWork W2917327790 @default.
- W4297805244 hasRelatedWork W3207412727 @default.
- W4297805244 hasRelatedWork W384763036 @default.
- W4297805244 hasRelatedWork W4286901599 @default.
- W4297805244 hasRelatedWork W4287814523 @default.
- W4297805244 hasRelatedWork W4288555402 @default.
- W4297805244 hasRelatedWork W4294558720 @default.
- W4297805244 isParatext "false" @default.
- W4297805244 isRetracted "false" @default.
- W4297805244 workType "article" @default.