Making an H $H$‐free graph k $k$‐colorable
From MaRDI portal
Publication:6093148
DOI10.1002/jgt.22868zbMath1522.05226arXiv2102.10220MaRDI QIDQ6093148
Zoe M. Himwich, Nitya Mani, Jacob Fox
Publication date: 6 October 2023
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2102.10220
Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Making a \(K_4\)-free graph bipartite
- The triangle-free process
- Explicit construction of linear sized tolerant networks
- Explicit Ramsey graphs and orthonormal labelings
- Approximating the independence number via the \(\vartheta\)-function
- Bipartite subgraphs of integer weighted graphs
- Maximum cuts and judicious partitions in graphs without short cycles
- Cycles of even length in graphs
- Multicolor Ramsey numbers via pseudorandom graphs
- On extremal problems of graphs and generalized graphs
- Bipartite subgraphs
- On Arithmetic Progressions of Cycle Lengths in Graphs
- A note on the Turán function of even cycles
- Graph removal lemmas
- Graph Theory and Probability
- On maximal paths and circuits of graphs
- The Algorithmic Aspects of the Regularity Lemma
- Maximum cuts of graphs with forbidden cycles
- The Ramsey number R(3, t) has order of magnitude t2/log t
- The Triangle-Free Process and the Ramsey Number 𝑅(3,𝑘)
- A Bound on the Number of Edges in Graphs Without an Even Cycle
- Some Extremal Properties of Bipartite Subgraphs
- MaxCut in ${\bm H)$-Free Graphs
- The regularity method for graphs with few 4‐cycles
- New results for MaxCut in H$H$‐free graphs
This page was built for publication: Making an H $H$‐free graph k $k$‐colorable
