Results 81 to 90 of about 538 (183)

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 ...
openaire   +5 more sources

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, Deryk Osthus, Andrew Treglown   +2 more
openaire   +3 more sources

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, RAJKO NENADOV, YURY PERSON, NEMANJA ŠKORIĆ, ANGELIKA STEGER, HENNING THOMAS   +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., Löwenstein Christian   +1 more
doaj   +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

A sharp upper bound on the spectral radius of a nonnegative k-uniform tensor and its applications to (directed) hypergraphs

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

Independence in 5-uniform hypergraphs

Discrete Mathematics, 2016
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Alex Eustis, Michael A. Henning, Anders Yeo   +2 more
openaire   +2 more sources

On judicious partitions of uniform hypergraphs

Journal of Combinatorial Theory, Series A, 2016
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jianfeng Hou, Shufei Wu, Guiying Yan
openaire   +2 more sources

One Turán Type Problem on Uniform Hypergraphs

Axioms
Let 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

Vertex-degree-based topological indices of uniform directed hypergraphs

Arab Journal of Basic and Applied Sciences
Modelling a chemical network is crucial for understanding the complex interactions and dynamics within a chemical system, allowing for precise predictions of reaction behaviour under various conditions.
Shashwath S. Shetty, K. Arathi Bhat
doaj   +1 more source