Note on the degree sequences of k-hypertournaments

DOI10.1016/J.DISC.2007.05.002MaRDI QIDQ2483417zbMATH OpenOpenAlexWikidataFDO

Authors Chao Wang, Guofei Zhou

Publication date 28 April 2008

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2007.05.002

zbMATH Keywords

\(k\)-hypertournamnetconsecutive pathdegree sequencekey arckey vertex

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Hypergraphs (05C65)

Review text

A \(k\)-hypertournament is a collection of \(n \choose k\) \(k\)-variations (where each subset occurs exactly once). The degree of vertex \(v\) in the (ordered) arc s \(k\) minus its place in the arc. The degree of \(v\) in the \(k\)-hypertournament is the sum of its degree in each arc. This new notion is a generalization of the so called score sequence (defined in 1953). The paper proves an Erdős-Gallai type condition for an integer sequence to be a degree sequence of a \(k\)-hypertournament.

Recommendations

• On score sequences of k-hypertournaments
• Hypertournaments-scores, losing scores, total scores and degrees
• scientific article; zbMATH DE number 2201401
• Degree sequences of k-multi-hypertournaments
• On score sequences of \(k\)-hypertournaments

Cites work

• A generalization of rotational tournaments
• Enchainabilité et seuil de monomorphie des tournois \(n\)-aires. (Chainability and threshold of the monomorphy of \(n\)-ary tournaments)
• Hamiltonian paths and cycles in hypertournaments
• scientific article; zbMATH DE number 3657692 (Why is no real title available?)
• scientific article; zbMATH DE number 1355273 (Why is no real title available?)
• On score sequences of \(k\)-hypertournaments
• On score sequences of k-hypertournaments
• What must be contained in every oriented k-uniform hypergraph

Cited in

(20)

• On \(k\)-hypertournament matrices
• A note on hypertournaments
• On score sequences of k-hypertournaments
• The (1, 2)-step competition graph of a hypertournament
• Arc-pancyclicity of hypertournaments with irregularity at most two
• Symmetry in domination for hypergraphs with choice
• Score lists in tripartite hypertournaments
• The \(H\)-force set of a hypertournament
• On score sequences of \(k\)-hypertournaments
• Regular Hypertournaments and Arc-Pancyclicity
• Miscellaneous digraph classes
• Score sequences in oriented k-hypergraphs
• On vertex independence number of uniform hypergraphs
• scientific article; zbMATH DE number 1941832 (Why is no real title available?)
• scientific article; zbMATH DE number 6930584 (Why is no real title available?)
• On scores, losing scores and total scores in \(k\)-hypertournaments
• scientific article; zbMATH DE number 2201401 (Why is no real title available?)
• On the scores and degrees in hypertournaments
• Degree sequence of oriented k-hypergraphs
• Degree sequences of k-multi-hypertournaments

This page was built for publication: Note on the degree sequences of \(k\)-hypertournaments

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