Generalized intransitive dice. II: Partition constructions

DOI10.3934/jdg.2021005zbMath1476.05063arXiv1905.01750OpenAlexW3134680440MaRDI QIDQ825253

Julia Saccamano, Ethan Akin

Publication date: 17 December 2021

Published in: Journal of Dynamics and Games (Search for Journal in Brave)

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

zbMATH Keywords

partitionsdigraphtournamentregular partitionsnontransitive diceintransitive dicemimicking a tournamentmodeling a tournament

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (2)

Nontransitivity of tuples of random variables with polynomial density and its effects in Bayesian models ⋮ Intransitivity and meta-intransitivity: meta-dice, levers and other opportunities

Cites Work

• Unnamed Item
• The composition of graphs
• Generalized intransitive dice: mimicking an arbitrary tournament
• On the composition of two tournaments
• Intransitive Dice
• The Theory of Round Robin Tournaments
• On Point-Symmetric Tournaments
• The lexicographic product of graphs

This page was built for publication: Generalized intransitive dice. II: Partition constructions