Hitting all maximum stable sets in \(P_5\)-free graphs

DOI10.1016/j.jctb.2023.11.005zbMath1530.05144arXiv2302.04986MaRDI QIDQ6187345

Yanjia Li, Sophie Spirkl, Sepehr Hajebi

Publication date: 15 January 2024

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

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

zbMATH Keywords

Ramsey theoryinduced subgraphsindependent sets

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Ramsey theory (05D10) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

• Induced subdivisions in \(K_{s,s}\)-free graphs of large average degree
• Ramsey-type theorems
• A bound on the chromatic number of graphs without certain induced subgraphs
• A characterization of perfect graphs
• On hitting all maximum cliques with an independent set
• Graph Theory and Probability
• Radius two trees specify χ‐bounded classes
• A survey of χ‐boundedness
• A Theorem on k-Saturated Graphs
• Even-hole-free graphs still have bisimplicial vertices
• Polynomial bounds for chromatic number. I. Excluding a biclique and an induced tree
• Polynomial bounds for chromatic number II: Excluding a star‐forest
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Hitting all maximum stable sets in \(P_5\)-free graphs