Results 61 to 70 of about 1,354,678 (274)
High Girth Hypergraphs with Unavoidable Monochromatic or Rainbow Edges
Discussiones Mathematicae Graph Theory, 2022 A classical result of Erdős and Hajnal claims that for any integers k, r, g ≥ 2 there is an r-uniform hypergraph of girth at least g with chromatic number at least k.
Axenovich Maria, Karrer Annette
doaj +1 more source
Cyclic Partitions of Complete and Almost Complete Uniform Hypergraphs
Discussiones Mathematicae Graph Theory, 2022 We consider cyclic partitions of the complete k-uniform hypergraph on a finite set V, minus a set of s edges, s ≥ 0. An s-almost t-complementary k-hypergraph is a k-uniform hypergraph with vertex set V and edge set E for which there exists a permutation ...
Dilbarjot, Gosselin Shonda Dueck
doaj +1 more source
Hamilton cycles in quasirandom hypergraphs [PDF]
, 2015 We show that, for a natural notion of quasirandomness in $k$-uniform hypergraphs, any quasirandom $k$-uniform hypergraph on $n$ vertices with constant edge density and minimum vertex degree $\Omega(n^{k-1})$ contains a loose Hamilton cycle.
Lenz, John +2 more
core +3 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 +1 more source
Matchings and Hamilton cycles in hypergraphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 It is well known that every bipartite graph with vertex classes of size $n$ whose minimum degree is at least $n/2$ contains a perfect matching. We prove an analogue of this result for uniform hypergraphs. We also provide an analogue of Dirac's theorem on
Daniela Kühn, Deryk Osthus
doaj +1 more source
An Irrational Turán Density via Hypergraph Lagrangian Densities
Electronic Journal of Combinatorics, 2022 Baber and Talbot asked whether there is an irrational Turán density of a single hypergraph. In this paper, we show that the Lagrangian density of a 4-uniform matching of size 3 is an irrational number. Sidorenko showed that the Lagrangian density of an r-
Biao Wu
semanticscholar +1 more source
On $\alpha$-spectral theory of a directed k-uniform hypergraph [PDF]
Computer Science Journal of Moldova, 2020 In this paper, we study a k-uniform directed hypergraph in general form and introduce its adjacency tensor, Laplacian tensor and signless Laplacian tensor. For the $k$-uniform directed hypergraph $\mathcal{H}$ and $0\leq \alpha
Gholam-Hasan Shirdel +2 more
doaj
Uniform hypergraphs containing no grids
Advances in Mathematics, 2013 A hypergraph is called an r by r grid if it is isomorphic to a pattern of r horizontal and r vertical lines. Three sets form a triangle if they pairwise intersect in three distinct singletons. A hypergraph is linear if every pair of edges meet in at most one vertex. In this paper we construct large linear r-hypergraphs which contain no grids. Moreover,
Füredi, Zoltán, Ruszinkó, Miklós
openaire +3 more sources
Non-uniform Evolving Hypergraphs and Weighted Evolving Hypergraphs [PDF]
Scientific Reports, 2016 AbstractFirstly, this paper proposes a non-uniform evolving hypergraph model with nonlinear preferential attachment and an attractiveness. This model allows nodes to arrive in batches according to a Poisson process and to form hyperedges with existing batches of nodes.
Jin-Li Guo +3 more
openaire +2 more sources
Transversals and domination in uniform hypergraphs
European Journal of Combinatorics, 2012 AbstractLet H=(V,E) be a hypergraph with vertex set V and edge set E of order nH=|V| and size mH=|E|. A transversal in H is a subset of vertices in H that has a nonempty intersection with every edge of H. The transversal number τ(H) of H is the minimum size of a transversal in H.
Zsolt Tuza +2 more
openaire +2 more sources