Disjoint isomorphic balanced clique subdivisions
From MaRDI portal
Publication:6038596
DOI10.1016/j.jctb.2023.03.002zbMath1512.05249arXiv2204.12465OpenAlexW4362704061MaRDI QIDQ6038596
Joseph Hyde, Hong Liu, Zhuo Wu, Oleg Pikhurko, Irene Gil Fernández
Publication date: 2 May 2023
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2204.12465
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Expander graphs (05C48)
Related Items (3)
Rainbow clique subdivisions ⋮ Balanced Subdivisions of a Large Clique in Graphs with High Average Degree ⋮ Tight bounds for divisible subdivisions
Cites Work
- Unnamed Item
- Unnamed Item
- Proof of a conjecture of Mader, Erdős and Hajnal on topological complete subgraphs
- Proof of Komlós's conjecture on Hamiltonian subsets
- Clique immersion in graphs without a fixed bipartite graph
- Homomorphieeigenschaften und mittlere Kantendichte von Graphen
- Existenz n-fach zusammenhängender Teilgraphen in Graphen genügend großer Kantendichte
- Highly linked graphs
- Subdivisions of graphs with large minimum degree
- Topological Cliques in Graphs
- A Note on Vertex-Disjoint Cycles
- Turán Numbers of Bipartite Graphs and Related Ramsey-Type Questions
- Topological cliques in graphs II
- Nested cycles with no geometric crossings
- Extremal density for sparse minors and subdivisions
- Crux and Long Cycles in Graphs
- A proof of Mader's conjecture on large clique subdivisions in C4-free graphs
- Hinreichende Bedingungen für die Existenz von Teilgraphen, die zu einem vollständigen Graphen homöomorph sind
- On the maximal number of independent circuits in a graph
- Ramsey numbers of cycles versus general graphs
- A solution to Erdős and Hajnal’s odd cycle problem
This page was built for publication: Disjoint isomorphic balanced clique subdivisions
