Results 11 to 20 of about 653 (189)
Maximum Hypergraphs without Regular Subgraphs
Discussiones Mathematicae Graph Theory, 2014 We show that an n-vertex hypergraph with no r-regular subgraphs has at most 2n−1+r−2 edges. We conjecture that if n > r, then every n-vertex hypergraph with no r-regular subgraphs having the maximum number of edges contains a full star, that is, 2n−1 ...
Kim Jaehoon, Kostochka Alexandr V.
doaj +4 more sources
Regular slices for hypergraphs [PDF]
Electronic Notes in Discrete Mathematics, 2015 Abstract We present a ‘Regular Slice Lemma’ which, given a k-graph G , returns a regular ( k − 1 ) -complex J with respect to which G has useful regularity properties. We believe that many arguments in extremal hypergraph theory are made considerably simpler by using this lemma rather than existing forms of the Strong ...
Peter Allen 0001 +3 more
core +4 more sources
The Existence of Quasi Regular and Bi-Regular Self-Complementary 3-Uniform Hypergraphs
Discussiones Mathematicae Graph Theory, 2016 A k-uniform hypergraph H = (V ;E) is called self-complementary if there is a permutation σ : V → V , called a complementing permutation, such that for every k-subset e of V , e ∈ E if and only if σ(e) ∉ E. In other words, H is isomorphic with H′ = (V ; V(
Kamble Lata N. +2 more
doaj +2 more sources
Transversals in regular uniform hypergraphs [PDF]
Journal of Graph Theory, 2023 AbstractThe transversal number of a hypergraph is the minimum number of vertices that intersect every edge of . This notion of transversal is fundamental in hypergraph theory and has been studied a great deal in the literature. A hypergraph is ‐regular if every vertex of has degree , that is, every vertex of belongs to exactly edges. Further, is
Michael A. Henning, Anders Yeo
openaire +3 more sources
Two-regular subgraphs of hypergraphs
Journal of Combinatorial Theory, Series B, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dhruv Mubayi, Jacques Verstraëte
openaire +3 more sources
Non-Abelian Topological Approach to Non-Locality of a Hypergraph State [PDF]
Entropy, 2015 We present a theoretical study of new families of stochastic complex information modules encoded in the hypergraph states which are defined by the fractional entropic descriptor.
Vesna Berec
doaj +2 more sources
Regular subgraphs of uniform hypergraphs
Journal of Combinatorial Theory, Series B, 2016 We prove that for every integer $r\geq 2$, an $n$-vertex $k$-uniform hypergraph $H$ containing no $r$-regular subgraphs has at most $(1+o(1)){{n-1}\choose{k-1}}$ edges if $k\geq r+1$ and $n$ is sufficiently large. Moreover, if $r\in\{3,4\}$, $r\mid k$ and $k,n$ are both sufficiently large, then the maximum number of edges in an $n$-vertex $k$-uniform ...
Kim, Jaehoon
openaire +5 more sources
Indecomposable regular graphs and hypergraphs
Discrete Mathematics, 1992 A hypergraph \(H\) consists of a finite nonempty set \(V(H)\) called the vertex set and a collection \(E(H)\) (called the edge set of \(H)\) of subsets of the power set of \(V(H)\). Note \(E(H)\) may contain the same set more then once. The number of times an element \(e\) in \(E(H)\) appears in \(E(H)\) is called its multiplicity denoted by \(m_ H(e)\)
Füredi, Zoltán
openaire +3 more sources
Spectra of Random Regular Hypergraphs [PDF]
The Electronic Journal of Combinatorics, 2021 In this paper, we study the spectra of regular hypergraphs following the definitions from Feng and Li (1996). Our main result is an analog of Alon's conjecture for the spectral gap of the random regular hypergraphs. We then relate the second eigenvalues to both its expansion property and the mixing rate of the non-backtracking random walk on regular ...
Ioana Dumitriu, Yizhe Zhu
openaire +3 more sources
On characterizing hypergraph regularity [PDF]
Random Structures & Algorithms, 2002 AbstractSzemerédi's Regularity Lemma is a well‐known and powerful tool in modern graph theory. This result led to a number of interesting applications, particularly in extremal graph theory. A regularity lemma for 3‐uniform hypergraphs developed by Frankl and Rödl [8] allows some of the Szemerédi Regularity Lemma graph applications to be extended to ...
Y. Dementieva +3 more
openaire +1 more source