Decomposition of tournament limits

DOI10.1016/J.EJC.2017.07.023zbMATH Open1371.05109arXiv1604.04271OpenAlexW2340787162MaRDI QIDQ2408970FDOQ2408970

Erik Thörnblad

Publication date: 10 October 2017

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

Abstract: The theory of tournament limits and tournament kernels (often called graphons) is developed by extending common notions for finite tournaments to this setting; in particular we study transitivity and irreducibility of limits and kernels. We prove that each tournament kernel and each tournament limit can be decomposed into a direct sum of irreducible components, with transitive components interlaced. We also show that this decomposition is essentially unique.

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

Recommendations

• scientific article; zbMATH DE number 7703245
• A note on decompositions of transitive tournaments. II
• Critical and infinite tournaments
• The morphology of infinite tournaments; application to the growth of their profile
• Decomposability index of tournaments

zbMATH Keywords

tournament kernels

Mathematics Subject Classification ID

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

Cites Work

• Limits of dense graph sequences
• Title not available (Why is that?)
• Title not available (Why is that?)
• Graph limits and exchangeable random graphs
• Moments of two-variable functions and the uniqueness of graph limits
• Analysis.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Convergent sequences of dense graphs. II. Multiway cuts and statistical physics
• Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
• The entropy of random-free graphons and properties
• Finitely forcible graphons
• Poset limits and exchangeable random posets
• Poset limits can be totally ordered
• Regularity partitions and the topology of graphons
• On exchangeable random variables and the statistics of large graphs and hypergraphs
• Threshold Graph Limits and Random Threshold Graphs
• The modular decomposition of countable graphs. Definition and construction in monadic second-order logic

Cited In (8)

• No additional tournaments are quasirandom-forcing
• The iterated local transitivity model for tournaments
• Impartial digraphs
• Decomposability index of tournaments
• The intransitive dice kernel: \( \frac{1\kern-2pt\mathrm{I}_{x\ge y}-1\kern-2pt\mathrm{I}_{x\le y}}{4} - \frac{3(x-y)(1+xy)}{8} \)
• Quasirandom-Forcing Orientations of Cycles
• Title not available (Why is that?)
• Cycles of a given length in tournaments

This page was built for publication: Decomposition of tournament limits

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2408970)