Towards the Erdős-Gallai cycle decomposition conjecture
From MaRDI portal
Publication:6499269
DOI10.1145/3564246.3585218MaRDI QIDQ6499269
Richard Montgomery, Matija Bucić
Publication date: 8 May 2024
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Small complete minors above the extremal edge density
- An Erdős-Gallai conjecture
- On the coverings of graphs
- On the combinatorial problems which I would most like to see solved
- Covers of Eulerian graphs
- Proof of Komlós's conjecture on Hamiltonian subsets
- Subgraph coverings and edge switchings
- Covering the edges of a connected graph by paths
- Gallai's conjecture for disconnected graphs
- Clique immersion in graphs without a fixed bipartite graph
- Long cycles in locally expanding graphs, with applications
- Rainbow Turán number of clique subdivisions
- Tree embeddings
- Long cycles in subgraphs of (pseudo)random directed graphs
- Subexponential Algorithms for Unique Games and Related Problems
- Path and cycle decompositions of dense graphs
- On Graph Complexity
- Expander graphs and their applications
- Testing Hereditary Properties of Nonexpanding Bounded-Degree Graphs
- What is the smallest number of dicycles in a dicycle decomposition of an eulerian digraph?
- Topological Cliques in Graphs
- Hall's theorem for hypergraphs
- Decomposing a graph into expanding subgraphs
- Topological cliques in graphs II
- A generalization of permanent inequalities and applications in counting and optimization
- Nested cycles with no geometric crossings
- Well-mixing vertices and almost expanders
- Extremal density for sparse minors and subdivisions
- Crux and Long Cycles in Graphs
- The Extremal Number of Tight Cycles
- Improved Distributed Expander Decomposition and Nearly Optimal Triangle Enumeration
- Logarithmically small minors and topological minors
- Cycle packing
- On the Number of Hamilton Cycles in Sparse Random Graphs
- A proof of Mader's conjecture on large clique subdivisions in C4-free graphs
- Decomposing Random Graphs into Few Cycles and Edges
- The Representation of a Graph by Set Intersections
- Ramsey numbers of cycles versus general graphs
- Optimal path and cycle decompositions of dense quasirandom graphs
- A solution to Erdős and Hajnal’s odd cycle problem
- How to build a pillar: a proof of Thomassen's conjecture
This page was built for publication: Towards the Erdős-Gallai cycle decomposition conjecture
