Decomposition of tournament limits

DOI10.1016/j.ejc.2017.07.023zbMath1371.05109arXiv1604.04271OpenAlexW2340787162MaRDI QIDQ2408970

Erik Thörnblad

Publication date: 10 October 2017

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1604.04271

zbMATH Keywords

tournament kernels

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20)

Related Items

Impartial digraphs, The iterated local transitivity model for tournaments, Quasirandom-Forcing Orientations of Cycles, Cycles of a given length in tournaments, No additional tournaments are quasirandom-forcing

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Convergent sequences of dense graphs. II. Multiway cuts and statistical physics
• Limits of dense graph sequences
• Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
• On exchangeable random variables and the statistics of large graphs and hypergraphs
• Finitely forcible graphons
• Moments of two-variable functions and the uniqueness of graph limits
• Poset limits and exchangeable random posets
• The modular decomposition of countable graphs. Definition and construction in monadic second-order logic
• The Entropy of Random-Free Graphons and Properties
• Regularity partitions and the topology of graphons
• Threshold Graph Limits and Random Threshold Graphs
• Graph limits and exchangeable random graphs
• Poset limits can be totally ordered