Permutation Capacities of Families of Oriented Infinite Paths

DOI10.1137/090765407zbMath1233.05197OpenAlexW2089098041MaRDI QIDQ5392903

Ágnes Tóth, János Körner, Marianne Fairthorne, Gábor Simonyi, Emanuela Fachini, Gérard D. Cohen, Graham R. Brightwell

Publication date: 15 April 2011

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/090765407

zbMATH Keywords

permutationsdigraphsgraph capacitiesAndré's problem

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20) Extremal combinatorics (05D99)

Related Items (8)

Maximum size of a family of pairwise graph-different permutations ⋮ Forbiddance and capacity ⋮ Connector families of graphs ⋮ Triangle-different Hamiltonian paths ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Divergent permutations ⋮ On $k$-Neighbor Separated Permutations

Uses Software

• OEIS

This page was built for publication: Permutation Capacities of Families of Oriented Infinite Paths