Antidirected trees in dense digraphs

DOI10.1137/24M165497XMaRDI QIDQ6994538zbMATH OpenFDO

Authors Maya Stein, Ana Laura Trujillo-Negrete

Publication date 23 April 2025

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

Full work available at URL https://doi.org/10.1137/24M165497X

zbMATH Keywords

antidirected treecaterpillardigraph

Mathematics Subject Classification ID

Trees (05C05) Directed graphs (digraphs), tournaments (05C20) Extremal problems in graph theory (05C35) Density (toughness, etc.) (05C42)

Cites work

• A Local Approach to the Erdös--Sós Conjecture
• Antidirected subgraphs of oriented graphs
• Antidirected Subtrees of Directed Graphs
• Antipaths in oriented graphs
• Constructing trees in graphs with no K_2,s
• scientific article; zbMATH DE number 431994 (Why is no real title available?)
• scientific article; zbMATH DE number 3258067 (Why is no real title available?)
• Long antipaths and anticycles in oriented graphs
• On Subtrees of Directed Graphs with No Path of Length Exceeding One
• On the Erdős–Sós conjecture for trees with bounded degree
• Oriented trees and paths in digraphs
• Oriented trees in digraphs
• Tree containment and degree conditions

Cited in

(1)

• Oriented trees in digraphs without oriented 4-cycles

This page was built for publication: Antidirected trees in dense digraphs

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