Results 111 to 120 of about 730,755 (216)

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

An Infinite Family of Connected 1-Factorisations of Complete 3-Uniform Hypergraphs [PDF]

, 2023
A connected 1-factorisation is a 1-factorisation of a hypergraph for which the union of each pair of distinct 1-factors is a connected hypergraph. A uniform 1-factorisation is a 1-factorisation of a hypergraph for which the union of each pair of distinct
Puskas, Anna, Maenhaut, Barbara, Mitchell, Jeremy   +2 more
core   +1 more source

Hypergraph Independent Sets [PDF]

, 2013
The study of extremal problems related to independent sets in hypergraphs is a problem that has generated much interest. There are a variety of types of independent sets in hypergraphs depending on the number of vertices from an independent set allowed ...
A. J. Radcliffe, Jonathan Cutler, Cutler, Jonathan, Radcliffe, A. J.   +3 more
core   +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

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

Hypergraphs with Pendant Paths are not Chromatically Unique

Discussiones Mathematicae Graph Theory, 2014
In this note it is shown that every hypergraph containing a pendant path of length at least 2 is not chromatically unique. The same conclusion holds for h-uniform r-quasi linear 3-cycle if r ≥ 2.
Tomescu Ioan
doaj   +1 more source

Hypergraph Representation via Axis-Aligned Point-Subspace Cover [PDF]

Discrete Mathematics & Theoretical Computer Science
We propose a new representation of $k$-partite, $k$-uniform hypergraphs, that is, a hypergraph with a partition of vertices into $k$ parts such that each hyperedge contains exactly one vertex of each type; we call them $k$-hypergraphs for short.
Oksana Firman, Joachim Spoerhase
doaj   +1 more source

BLOCK DESIGN DENGAN PENDEKATAN INCIDENCE MATRIX k-UNIFORM HYPERGRAPH

Suatu hypergraph didefinisikan sebagai pasangan himpunan ( , ) di mana = { 1, 2, … , } adalah himpunan terbatas yang anggotanya disebut dengan vertex dan = { 1, 2, … , } adalah himpunan hyperedge , = 1, 2, … , di mana merupakan ...
Baki, Swita, Mudin, Simanihuruk, SARI, NABILA PUTRI ENDAH   +2 more
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