Unavoidable subgraphs in digraphs with large out-degrees

DOI10.1137/25M1767376MaRDI QIDQ7356627zbMATH OpenFDO

Authors Tomáš Hons, Tereza Klimošová, Gaurav Sunil Kucheriya, David Mikšaník, Josef Tkadlec, Mykhaylo Tyomkyn

Publication date 24 September 2026

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

Full work available at URL https://doi.org/10.1137/25M1767376

Mathematics Subject Classification ID

Trees (05C05) Vertex degrees (05C07) Directed graphs (digraphs), tournaments (05C20) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites work

• A note on digraph splitting
• Alternating paths in oriented graphs with large semidegree
• An improved bound for disjoint directed cycles
• Antidirected Subtrees of Directed Graphs
• Antipaths in oriented graphs
• Cycles in digraphs– a survey
• Digraphs
• Disjoint directed cycles
• Existence of vertices of local connectivity \(k\) in digraphs of large outdegree
• scientific article; zbMATH DE number 3630786 (Why is no real title available?)
• scientific article; zbMATH DE number 944226 (Why is no real title available?)
• Long paths and cycles in oriented graphs
• On the length of directed paths in digraphs
• On topological tournaments of order 4 in digraphs of outdegree 3
• Oriented cycles in digraphs of large outdegree
• Oriented trees and paths in digraphs
• Spanning trees in dense directed graphs
• Splitting digraphs
• Subdivisions in digraphs of large out-degree or large dichromatic number

This page was built for publication: Unavoidable subgraphs in digraphs with large out-degrees

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