Results 111 to 120 of about 728,495 (209)
SYMMETRIC AND ASYMMETRIC RAMSEY PROPERTIES IN RANDOM HYPERGRAPHS
Forum of Mathematics, Sigma, 2017 A celebrated result of Rödl and Ruciński states that for every graph $F$ , which is not a forest of stars and paths of length 3, and fixed number of colours
LUCA GUGELMANN +5 more
doaj +1 more source
A Characterization of Hypergraphs with Large Domination Number
Discussiones Mathematicae Graph Theory, 2016 Let H = (V, E) be a hypergraph with vertex set V and edge set E. A dominating set in H is a subset of vertices D ⊆ V such that for every vertex v ∈ V \ D there exists an edge e ∈ E for which v ∈ e and e ∩ D ≠ ∅.
Henning Michael A. +1 more
doaj +1 more source
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
Matchings in 3-uniform hypergraphs
Journal of Combinatorial Theory, Series B, 2013 We determine the minimum vertex degree that ensures a perfect matching in a 3-uniform hypergraph. More precisely, suppose that H is a sufficiently large 3-uniform hypergraph whose order n is divisible by 3. If the minimum vertex degree of H is greater than \binom{n-1}{2}-\binom{2n/3}{2}, then H contains a perfect matching.
Daniela Kühn +2 more
openaire +3 more sources
Eigenvalues of K-Uniform Hypergraphs
, 2017 A Thesis Submitted to the Faculty of Graduate Studies and Research In Partial Fulfillment of the Requirements for the Degree of Master of Science in Mathematics, University of Regina.
Gorr, Adam Vernon
core +1 more source
Partitioning 3-uniform hypergraphs
Journal of Combinatorial Theory, Series B, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jie Ma 0002, Xingxing Yu
openaire +2 more sources
Irregular triads in 3-uniform hypergraphs
Over the past several years, numerous authors have explored model theoretically motivated combinatorial conditions that ensure that a graph has an efficient regular decomposition in the sense of Szemer\'edi.
core +2 more sources
Wickets in 3-uniform Hypergraphs [PDF]
, 2023 In these notes, we consider a Tur\'an-type problem in hypergraphs. What is the maximum number of edges if we forbid a subgraph? Let $H_n^{(3)}$ be a 3-uniform linear hypergraph, i.e. any two edges have at most one vertex common.
Solymosi, Jozsef
core
One Turán Type Problem on Uniform Hypergraphs
AxiomsLet n,m,p,r∈N with p≥n≥r. For a hypergraph, if each edge has r vertices, then the hypergraph is called an r-graph. Define er(n,m;p) to be the maximum number of edges of an r-graph with p vertices in which every subgraph of n vertices has at most m edges.
Linlin Wang, Sujuan Liu
doaj +1 more source
Focal-free uniform hypergraphs and codes [PDF]
Motivated by the study of a variant of sunflowers, Alon and Holzman recently introduced focal-free hypergraphs. In this paper, we show that there is an interesting connection between the maximum size of focal-free hypergraphs and the renowned Erdős ...
Huang, Xinqi +3 more
core +1 more source