Impartial digraphs
From MaRDI portal
Publication:2663414
DOI10.1007/S00493-020-4280-0zbMath1474.05167arXiv1906.10482OpenAlexW3035281034MaRDI QIDQ2663414
Publication date: 16 April 2021
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1906.10482
Related Items (4)
Quasirandom-Forcing Orientations of Cycles ⋮ Paths of given length in tournaments ⋮ Cycles of a given length in tournaments ⋮ No additional tournaments are quasirandom-forcing
Cites Work
- Unnamed Item
- An approximate version of Sidorenko's conjecture
- A reverse Sidorenko inequality
- Supersaturated graphs and hypergraphs
- Finite reflection groups and graph norms
- A correlation inequality for bipartite graphs
- Decomposition of tournament limits
- Two approaches to Sidorenko’s conjecture
- Regularity partitions and the topology of graphons
- Sidorenko's conjecture for blow-ups
- Graph limits and exchangeable random graphs
- Some advances on Sidorenko's conjecture
- On the Density of Transitive Tournaments
- Positive graphs
- Graph norms and Sidorenko's conjecture
This page was built for publication: Impartial digraphs