Results 51 to 60 of about 1,354,678 (274)
On the Degree Sequences of Uniform Hypergraphs [PDF]
, 2013 In hypergraph theory, determining a good characterization of d, the degree sequence of an h-uniform hypergraph $\mathcal{H}$, and deciding the complexity status of the reconstruction of $\mathcal{H}$ from d, are two challenging open problems. They can be formulated in the context of discrete tomography: asks whether there is a matrix A with nonnegative
FROSINI, ANDREA +2 more
openaire +3 more sources
On rainbow-free colourings of uniform hypergraphs [PDF]
Theoretical Computer Science, 2021 We study rainbow-free colourings of $k$-uniform hypergraphs; that is, colourings that use $k$ colours but with the property that no hyperedge attains all colours. We show that $p^*=(k-1)(\ln n)/n$ is the threshold function for the existence of a rainbow-free colouring in a random $k$-uniform hypergraph.
Groot Koerkamp, Ragnar +1 more
openaire +3 more sources
High-order Line Graphs of Non-uniform Hypergraphs: Algorithms, Applications, and Experimental Analysis [PDF]
IEEE International Parallel and Distributed Processing Symposium, 2022 Hypergraphs offer flexible and robust data representations for many applications, but methods that work directly on hypergraphs are not readily available and tend to be prohibitively expensive.
Xu T. Liu +7 more
semanticscholar +1 more source
Almost Self-Complementary Uniform Hypergraphs
Discussiones Mathematicae Graph Theory, 2018 A k-uniform hypergraph (k-hypergraph) is almost self-complementary if it is isomorphic with its complement in the complete k-uniform hypergraph minus one edge. We prove that an almost self-complementary k-hypergraph of order n exists if and only if (nk)$\
Wojda Adam Paweł
doaj +1 more source
The Lagrangian Density of {123, 234, 456} and the Turán Number of its Extension
Discussiones Mathematicae Graph Theory, 2021 Given a positive integer n and an r-uniform hypergraph F, the Turán number ex(n, F ) is the maximum number of edges in an F -free r-uniform hypergraph on n vertices.
Chen Pingge, Liang Jinhua, Peng Yuejian
doaj +1 more source
Inapproximability of Counting Hypergraph Colourings [PDF]
ACM Transactions on Computation Theory, 2021 Recent developments in approximate counting have made startling progress in developing fast algorithmic methods for approximating the number of solutions to constraint satisfaction problems (CSPs) with large arities, using connections to the Lovász Local
Andreas Galanis, Heng Guo, Jiaheng Wang
semanticscholar +1 more source
On the fractional total domatic numbers of incidence graphs
Mathematical Modelling and Control, 2023 For a hypergraph $ H $ with vertex set $ X $ and edge set $ Y $, the incidence graph of hypergraph $ H $ is a bipartite graph $ I(H) = (X, Y, E) $, where $ xy\in E $ if and only if $ x\in X $, $ y\in Y $ and $ x\in y $.
Yameng Zhang, Xia Zhang
doaj +1 more source
Covering complete partite hypergraphs by monochromatic components [PDF]
, 2016 A well-known special case of a conjecture attributed to Ryser states that k-partite intersecting hypergraphs have transversals of at most k-1 vertices. An equivalent form was formulated by Gy\'arf\'as: if the edges of a complete graph K are colored with ...
Gyárfás, András, Király, Zoltán
core +2 more sources
Journal of Inequalities and Applications, 2020 In this paper, we obtain a sharp upper bound on the spectral radius of a nonnegative k-uniform tensor and characterize when this bound is achieved. Furthermore, this result deduces the main result in [X. Duan and B.
Chuang Lv, Lihua You, Xiao-Dong Zhang
doaj +1 more source
Towards a Hypergraph version of the Pósa–Seymour Conjecture [PDF]
Advances in Combinatorics, 2021 We prove that for fixed $r\ge k\ge 2$, every $k$-uniform hypergraph on $n$ vertices having minimum codegree at least $(1-(\binom{r-1}{k-1}+\binom{r-2}{k-2})^{-1})n+o(n)$ contains the $(r-k+1)$th power of a tight Hamilton cycle. This result may be seen as
Mat'ias Pavez-Sign'e +2 more
semanticscholar +1 more source