Clique immersion in graphs without a fixed bipartite graph
From MaRDI portal
Publication:2171024
DOI10.1016/j.jctb.2022.07.008zbMath1497.05183arXiv2011.10961OpenAlexW4292262955MaRDI QIDQ2171024
Hong Liu, Donglei Yang, Guang-Hui Wang
Publication date: 23 September 2022
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2011.10961
Extremal problems in graph theory (05C35) Combinatorial probability (60C05) Coloring of graphs and hypergraphs (05C15) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (5)
Well-mixing vertices and almost expanders ⋮ Crux and Long Cycles in Graphs ⋮ Disjoint isomorphic balanced clique subdivisions ⋮ How to build a pillar: a proof of Thomassen's conjecture ⋮ Towards the Erdős-Gallai cycle decomposition conjecture
Cites Work
- A minimum degree condition forcing complete graph immersion
- Complete minors in \(K_{s,s}\)-free graphs
- Lower bound of the Hadwiger number of graphs by their average degree
- Graph minors XXIII. Nash-Williams' immersion conjecture
- Minors in expanding graphs
- A bound on the chromatic number of a graph
- Hadwiger's conjecture for \(K_ 6\)-free graphs
- The extremal function for complete minors
- Constructing Graphs with No Immersion of Large Complete Graphs
- Graph Coloring and the Immersion Order
- Immersing small complete graphs
- Complete graph immersions and minimum degree
- Topological cliques in graphs II
- A proof of Mader's conjecture on large clique subdivisions in C4-free graphs
- On a problem of K. Zarankiewicz
- Forcing clique immersions through chromatic number
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Clique immersion in graphs without a fixed bipartite graph
