On score sequences of \(k\)-hypertournaments

DOI10.1006/eujc.2000.0393zbMath0966.05037OpenAlexW1989301087MaRDI QIDQ1590213

Guofel Zhou, Tianxing Yao, Ke Min Zhang

Publication date: 16 August 2001

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

Full work available at URL: https://doi.org/10.1006/eujc.2000.0393

zbMATH Keywords

tournamenthypertournamentscore sequences

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Related Items (14)

Score lists in tripartite hypertournaments ⋮ On vertex independence number of uniform hypergraphs ⋮ Regular Hypertournaments and Arc-Pancyclicity ⋮ On the scores and degrees in hypertournaments ⋮ On \(k\)-hypertournament matrices ⋮ The \(H\)-force set of a hypertournament ⋮ Score lists in \( (h, k)\)-bipartite hypertournaments ⋮ Uniform sampling ofk-hypertournaments ⋮ Note on the degree sequences of \(k\)-hypertournaments ⋮ Degree sequences of \(k\)-multi-hypertournaments ⋮ The (1, 2)-step competition graph of a hypertournament ⋮ Miscellaneous Digraph Classes ⋮ Symmetry in domination for hypergraphs with choice ⋮ On scores, losing scores and total scores in hypertournaments

Cites Work

• Enchainabilité et seuil de monomorphie des tournois \(n\)-aires. (Chainability and threshold of the monomorphy of \(n\)-ary tournaments)
• What must be contained in every oriented k-uniform hypergraph
• A generalization of rotational tournaments
• Hamiltonian paths and cycles in hypertournaments
• The Theory of Round Robin Tournaments

This page was built for publication: On score sequences of \(k\)-hypertournaments