Colorful induced subgraphs

DOI10.1016/0012-365X(92)90600-KzbMath0765.05047OpenAlexW2165619621MaRDI QIDQ1197025

William T. jun. Trotter, Henry A. Kierstead

Publication date: 16 January 1993

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

Full work available at URL: https://doi.org/10.1016/0012-365x(92)90600-k

zbMATH Keywords

Ramsey numbertriangle-free graphdirected pathcolored digraphnatural orientationcolorful subgraphdirected star

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55)

Related Items (11)

Induced subgraphs of graphs with large chromatic number. IX: Rainbow paths ⋮ Induced subgraphs of graphs with large chromatic number. XI. Orientations ⋮ Applications of hypergraph coloring to coloring graphs not inducing certain trees ⋮ Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022 ⋮ Proving a directed analogue of the Gyárfás-Sumner conjecture for orientations of \(P_4\) ⋮ Induced colorful trees and paths in large chromatic graphs ⋮ On induced colourful paths in triangle-free graphs ⋮ Extension of Gyárfás-Sumner conjecture to digraphs ⋮ Structure and colour in triangle-free graphs ⋮ The balanced connected subgraph problem ⋮ A counterexample to a conjecture about triangle-free induced subgraphs of graphs with large chromatic number

Cites Work

• Induced subtrees in graphs of large chromatic number
• On the structure of set-mappings
• Radius two trees specify χ‐bounded classes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Colorful induced subgraphs