Subdivisions of digraphs in tournaments
From MaRDI portal
Publication:2221927
DOI10.1016/j.jctb.2020.09.006zbMath1457.05042arXiv1908.03733OpenAlexW3088059121MaRDI QIDQ2221927
Richard Snyder, Kamil Popielarz, António Girão
Publication date: 3 February 2021
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1908.03733
Related Items (10)
On 1-subdivisions of transitive tournaments ⋮ Strong complete minors in digraphs ⋮ Rolling backwards can move you forward: On embedding problems in sparse expanders ⋮ Ramsey number of 1-subdivisions of transitive tournaments ⋮ Complete directed minors and chromatic number ⋮ Subdivisions with congruence constraints in digraphs of large chromatic number ⋮ Tight bounds for divisible subdivisions ⋮ An improved linear connectivity bound for tournaments to be highly linked ⋮ \((2k+1)\)-connected tournaments with large minimum out-degree are \(k\)-linked ⋮ Dichromatic number and forced subdivisions
Cites Work
- Unnamed Item
- Highly linked tournaments
- Even cycles in directed graphs
- Extremal digraph results for topological complete subgraphs
- Subdivisions of transitive tournaments
- Highly linked tournaments with large minimum out-degree
- Homomorphieeigenschaften und mittlere Kantendichte von Graphen
- Highly linked graphs
- A note on complete subdivisions in digraphs of large outdegree
- Turán Numbers of Bipartite Graphs and Related Ramsey-Type Questions
- On topological tournaments of order 4 in digraphs of outdegree 3
- Topological cliques in graphs II
- Hinreichende Bedingungen für die Existenz von Teilgraphen, die zu einem vollständigen Graphen homöomorph sind
This page was built for publication: Subdivisions of digraphs in tournaments