Results 131 to 140 of about 728,495 (209)

Minimum Degrees and Codegrees of Ramsey-Minimal 3-Uniform Hypergraphs

, 2016
A uniform hypergraph H is called k-Ramsey for a hypergraph F if, no matter how one colours the edges of H with k colours, there is always a monochromatic copy of F.
Clemens, Dennis, Person, Yury
core   +1 more source

Cycle decompositions in $k$-uniform hypergraphs [PDF]

We show that $k$-uniform hypergraphs on $n$ vertices whose codegree is at least $(2/3 + o(1))n$ can be decomposed into tight cycles, subject to the trivial divisibility conditions.
Lo, Allan, Sanhueza-Matamala, Nicolás, Piga, Simon; id_orcid, Piga, Simón, Sanhueza Matamala, Nicolas, Lo, Allan; id_orcid   +5 more
core   +1 more source

Online matching on 3-uniform hypergraphs

Mathematical Programming
Abstract The online matching problem was introduced by Karp, Vazirani and Vazirani (STOC 1990) on bipartite graphs with vertex arrivals. It is well-known that the optimal competitive ratio is $$1-1/e$$
S.J. Borst (Sander), D. Kashaev (Danish), Z.K. Koh (Zhuan Khye)   +2 more
openaire   +7 more sources

Turán Problems on Non-uniform Hypergraphs

, 2014
A non-uniform hypergraph H = (V, E) consists of a vertex set V and an edge set E ⊆ 2 V; the edges in E are not required to all have the same cardinality. The set of all cardinalities of edges in H is denoted by R(H), the set of edge types.
Johnston, Jeremy Travis
core   +1 more source

Coloring [Formula: see text]-Embeddable [Formula: see text]-Uniform Hypergraphs. [PDF]

Discrete Comput Geom, 2014
Heise CG, Panagiotou K, Pikhurko O, Taraz A.   +3 more
europepmc   +1 more source

A classification of Mengerian $4$-uniform hypergraphs derived from graphs [PDF]

In this paper, we give a classification of all Mengerian $4$-uniform hypergraphs derived from graphs.to appear in Ars ...
Hochstättler, Winfried, Nasernejad, Mehrdad   +1 more
core  

On the distinguishing partitions and asymmetric uniform hypergraphs

, 2016
This study is an exposition of the first three sections of the paper entitled Distinguishing Partitions and Asymmetric Uniform Hypergraphs by Ellingham and Schroeder, which appeared in ARS Mathematica Comtemporanea [7].
Casanova, Juliet R., Ognita, Dave Nicole P.   +1 more
core  

Higher-order trade-offs in hypergraph community detection. [PDF]

Sci Adv
Li J, Schaub MT, Peel L.
europepmc   +1 more source

Cover-free families on hypergraphs and combinatorial group testing. [PDF]

J Comb Optim
Idalino TB, Moura L.
europepmc   +1 more source