On the Chromatic Number of Subgraphs of a Given Graph

DOI10.2307/2041460MaRDI QIDQ4194980zbMATH OpenOpenAlexFDO

Authors Vojtěch Rödl

Publication date 1977

Published in Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2041460

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cited in

(17)

• From \(\chi\)- to \(\chi_p\)-bounded classes
• \(C_4\)-free subgraphs with large average degree
• Chromatic number and regular subgraphs
• Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022
• Extremal triangle-free and odd-cycle-free colourings of uncountable graphs
• Triangle-free subgraphs with large fractional chromatic number
• Graphs of large chromatic number
• Subgraphs of Kneser graphs with large girth and large chromatic number
• Triangle-free subgraphs with large fractional chromatic number
• On a conjecture of Thomassen concerning subgraphs of large girth
• A note on Thomassen's conjecture
• On forbidden subdivision characterizations of graph classes
• The Erdős-Hajnal problem list
• A survey of degree-boundedness
• Combinatorics. Abstracts from the workshop held January 1--7, 2023
• A polynomial Turing-kernel for weighted independent set in bull-free graphs
• A counterexample to a conjecture about triangle-free induced subgraphs of graphs with large chromatic number

This page was built for publication: On the Chromatic Number of Subgraphs of a Given Graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4194980)