Immersion of complete digraphs in Eulerian digraphs
From MaRDI portal
Publication:6561668
DOI10.1007/S11856-023-2572-YzbMATH Open1542.05065MaRDI QIDQ6561668FDOQ6561668
Publication date: 25 June 2024
Published in: Israel Journal of Mathematics (Search for Journal in Brave)
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
- Topological cliques in graphs II
- Highly linked graphs
- Immersing small complete graphs
- A minimum degree condition forcing complete graph immersion
- A note on forbidding clique immersions
- Complete graph immersions and minimum degree
- Even cycles in directed graphs
- Degree and local connectivity in digraphs
- Immersing complete digraphs
- On topological tournaments of order 4 in digraphs of outdegree 3
- Topological Cliques in Graphs
- A solution to Erdős and Hajnal’s odd cycle problem
- Extremal density for sparse minors and subdivisions
- Immersion of transitive tournaments in digraphs with large minimum outdegree
- Proof of Komlós's conjecture on Hamiltonian subsets
- A proof of Mader's conjecture on large clique subdivisions in C4-free graphs
- Clique immersion in graphs without a fixed bipartite graph
- Extremal connectivity for topological cliques in bipartite graphs
- Rainbow Turán number of clique subdivisions
- Nested cycles with no geometric crossings
Cited In (1)
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)
