Highly Connected Subgraphs with Large Chromatic Number

DOI10.1137/22m150040xarXiv2206.00561OpenAlexW4390770231MaRDI QIDQ6141860

Tung H. Nguyen

Publication date: 23 January 2024

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2206.00561

zbMATH Keywords

connectivitychromatic numbersubgraphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Substitution and \(\chi\)-boundedness
• On the number of edges in a graph with no \((k + 1)\)-connected subgraphs
• Progress towards Nash-Williams' conjecture on triangle decompositions
• Existenz n-fach zusammenhängender Teilgraphen in Graphen genügend großer Kantendichte
• Isolating Highly Connected Induced Subgraphs
• Graph decomposition with applications to subdivisions and path systems modulo k
• Subgraphs of large connectivity and chromatic number in graphs of large chromatic number
• A survey of χ‐boundedness
• Subgraphs of large connectivity and chromatic number

This page was built for publication: Highly Connected Subgraphs with Large Chromatic Number