All Feedback Arc Sets of a Random Turán Tournament Have $\lfloor {n}/{k}\rfloor-{k}+1$ Disjoint ${k}$-Cliques (and This Is Tight)
From MaRDI portal
Publication:4997139
DOI10.1137/20M1356506zbMath1467.05095arXiv2106.15470OpenAlexW3177473685MaRDI QIDQ4997139
Publication date: 28 June 2021
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2106.15470
Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Directed graphs (digraphs), tournaments (05C20)
Cites Work
- Unnamed Item
- Unnamed Item
- On extremal hypergraphs for Hamiltonian cycles
- The Turán number of sparse spanning graphs
- Arc coverings of graphs
- On the maximum cardinality of a consistent set of arcs in a random tournament
- Perfect matchings in large uniform hypergraphs with large minimum collective degree
- Vertex coverings by monochromatic cycles and trees
- Acyclic subgraphs with high chromatic number
- Oriented trees in digraphs
- Corrádi and Hajnal's Theorem for Sparse Random Graphs
- Local resilience of graphs
- Triangle Factors in Random Graphs
- Ranking Tournaments
- Optimal ranking of tournaments
This page was built for publication: All Feedback Arc Sets of a Random Turán Tournament Have $\lfloor {n}/{k}\rfloor-{k}+1$ Disjoint ${k}$-Cliques (and This Is Tight)
