Score sequences in oriented k-hypergraphs
Abstract
Given two non-negative integers n and k with n≥ k>1, an oriented k-hypergraph on n vertices is a pair (V,A), where V is a set of vertices with |V| =n and A is a set of k-tuples of vertices, called arcs, such that for any k-subset S of V, A contains at most one of the k! k-tuples whose entries belong to S.
In this paper, we define the score of a vertex in an oriented k-hypergraph and then give a necessary and sufficient condition for the sequence of non-negative integers [s₠, s₂ , …, sn] to be a score sequence of some oriented k-hypergraph.
Downloads
Published
Issue
Section
License
Upon acceptance of an article by the European Journal of Pure and Applied Mathematics, the author(s) retain the copyright to the article. However, by submitting your work, you agree that the article will be published under the Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0). This license allows others to copy, distribute, and adapt your work, provided proper attribution is given to the original author(s) and source. However, the work cannot be used for commercial purposes.
By agreeing to this statement, you acknowledge that:
- You retain full copyright over your work.
- The European Journal of Pure and Applied Mathematics will publish your work under the Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0).
- This license allows others to use and share your work for non-commercial purposes, provided they give appropriate credit to the original author(s) and source.