Immersion of complete digraphs in Eulerian digraphs

DOI10.1007/S11856-023-2572-YzbMATH Open1542.05065MaRDI QIDQ6561668FDOQ6561668

Authors: António Girão, Shoham Letzter 

Publication date: 25 June 2024

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

Recommendations

• Immersing complete digraphs
• Immersion of transitive tournaments in digraphs with large minimum outdegree
• Strong immersion is a well-quasi-ordering for semicomplete digraphs
• Complete graph immersions and minimum degree

zbMATH Keywords

Eulerian multi-digraphs

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Extremal problems in graph theory (05C35)

Cites Work

• A minimum degree condition forcing complete graph immersion
• A note on forbidding clique immersions
• A proof of Mader's conjecture on large clique subdivisions in \(C_4\)-free graphs
• A solution to Erdős and Hajnal’s odd cycle problem
• Clique immersion in graphs without a fixed bipartite graph
• Complete graph immersions and minimum degree
• Degree and local connectivity in digraphs
• Even cycles in directed graphs
• Extremal connectivity for topological cliques in bipartite graphs
• Extremal density for sparse minors and subdivisions
• Highly linked graphs
• Immersing complete digraphs
• Immersing small complete graphs
• Immersion of transitive tournaments in digraphs with large minimum outdegree
• Nested cycles with no geometric crossings
• On topological tournaments of order 4 in digraphs of outdegree 3
• Rainbow Turán number of clique subdivisions
• Topological Cliques in Graphs
• Topological cliques in graphs II

Cited In (1)

• Separating path systems of almost linear size

This page was built for publication: Immersion of complete digraphs in Eulerian digraphs

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