Variants of the Gyárfás-Sumner conjecture: oriented trees and rainbow paths

DOI10.1002/JGT.23171MaRDI QIDQ6642519

L. Sunil Chandran, Karthik Murali, Mathew C. Francis, Manu Basavaraju

Publication date: 24 November 2024

Published in: Journal of Graph Theory (Search for Journal in Brave)

zbMATH Keywords

chromatic numberGyárfás-Sumner conjectureGallai-Roy-Vitaver theoreminduced oriented treesinduced rainbow paths

Mathematics Subject Classification ID

Trees (05C05) Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Induced colorful trees and paths in large chromatic graphs
• Coloring graphs with locally few colors
• Induced subtrees in graphs of large chromatic number
• Colorful induced subgraphs
• Induced subgraphs of graphs with large chromatic number. XI. Orientations
• Oriented trees in digraphs
• Induced subgraphs of graphs with large chromatic number. IX: Rainbow paths
• Graph Theory and Probability
• A survey of χ‐boundedness
• The History of Degenerate (Bipartite) Extremal Graph Problems
• On weakly ordered systems
• On induced colourful paths in triangle-free graphs

This page was built for publication: Variants of the Gyárfás-Sumner conjecture: oriented trees and rainbow paths

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