Packing subdivisions into regular graphs
From MaRDI portal
Cites work
- A Note on Vertex-Disjoint Cycles
- A solution to Erdős and Hajnal’s odd cycle problem
- Approximate path decompositions of regular graphs
- Asymptotically optimal tree-packings in regular graphs
- Balanced subdivisions of cliques in graphs
- Disjoint isomorphic balanced clique subdivisions
- Divisible subdivisions
- Extremal connectivity for topological cliques in bipartite graphs
- Extremal density for sparse minors and subdivisions
- Graph decomposition with applications to subdivisions and path systems modulo k
- Hinreichende Bedingungen für die Existenz von Teilgraphen, die zu einem vollständigen Graphen homöomorph sind
- Homomorphieeigenschaften und mittlere Kantendichte von Graphen
- scientific article; zbMATH DE number 1540669 (Why is no real title available?)
- scientific article; zbMATH DE number 3204304 (Why is no real title available?)
- Linear arboricity and linear k-arboricity of regular graphs
- Logarithmically small minors and topological minors
- Nearly Hamilton cycles in sublinear expanders and applications
- Packings in Dense Regular Graphs
- Problems and results in extremal combinatorics. I.
- Proof of a conjecture of Mader, Erdős and Hajnal on topological complete subgraphs
- Subdivisions of graphs with large minimum degree
- Sublinear expanders and their applications
- Sur le problème des courbes gauches en topologie.
- The probabilistic method
- Tight bounds for divisible subdivisions
- Topological Cliques in Graphs
- Topological cliques in graphs II
- Towards the linear arboricity conjecture
This page was built for publication: Packing subdivisions into regular graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7292149)
