Oriented trees in digraphs without oriented 4-cycles

DOI10.1016/J.DISC.2026.115288MaRDI QIDQ7326022zbMATH OpenFDO

Authors Maya Stein, Ana Laura Trujillo-Negrete

Publication date 8 September 2026

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DISC.2026.115288

Mathematics Subject Classification ID

Trees (05C05) Vertex degrees (05C07) Directed graphs (digraphs), tournaments (05C20)

Cites work

• A randomized embedding algorithm for trees
• A variant of the Erdős-Sós conjecture
• Alternating paths in oriented graphs with large semidegree
• Antidirected subgraphs of oriented graphs
• Antidirected trees in dense digraphs
• Antipaths in oriented graphs
• Degree conditions for embedding trees
• Embedding trees into graphs of large girth
• scientific article; zbMATH DE number 3708430 (Why is no real title available?)
• Long antipaths and anticycles in oriented graphs
• On a conjecture about trees in graphs with large girth
• Oriented trees and paths in digraphs
• Oriented trees in digraphs
• Spanning trees in graphs of high minimum degree with a universal vertex I: An asymptotic result
• Spanning trees in graphs of high minimum degree with a universal vertex II: A tight result
• The Erdös-Sós conjecture for graphs of girth 5
• The Erdös-Sós conjecture for graphs without \(C_ 4\)
• Tree containment and degree conditions

This page was built for publication: Oriented trees in digraphs without oriented 4-cycles

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