Results 141 to 150 of about 1,354,678 (274)

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

On the Maximum Estrada Index of 3-Uniform Linear Hypertrees

The Scientific World Journal, 2014
For a simple hypergraph H on n vertices, its Estrada index is defined as EE(H)=∑i=1n‍eλi, where λ1,λ2,…,λn are the eigenvalues of its adjacency matrix. In this paper, we determine the unique 3-uniform linear hypertree with the maximum Estrada index.
Faxu Li, Liang Wei, Jinde Cao, Feng Hu, Haixing Zhao   +4 more
doaj   +1 more source

Perfect Matchings in Random r-regular, s-uniform Hypergraphs [PDF]

, 1996
Colin Cooper, Alan Frieze, Michael Molloy, Bruce Reed   +3 more
openalex   +1 more source

Wickets in 3-uniform hypergraphs

Discrete Mathematics
In these notes, we consider a Turán-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. A special hypergraph, called {\em wicket}, is formed by three rows and two columns of a $3 \times 3$ point matrix.
openaire   +2 more sources

Greedy colorings of uniform hypergraphs [PDF]

, 2009
András Pluhár
openalex   +1 more source

Kneser Colorings of Uniform Hypergraphs [PDF]

, 2009
Carlos Hoppen, Yoshiharu Kohayakawa, Hanno Lefmann   +2 more
openalex   +1 more source

Loose Hamilton Cycles in Random Uniform Hypergraphs [PDF]

, 2011
Andrzej Dudek, Alan Frieze
openalex   +1 more source

The eigenvectors associated with the zero eigenvalues of the Laplacian and signless Laplacian tensors of a uniform hypergraph [PDF]

Discrete Applied Mathematics, 2013
Shenglong Hu, L. Qi
semanticscholar   +1 more source

Packing tight Hamilton cycles in 3-uniform hypergraphs [PDF]

, 2011
Alan Frieze, Michael Krivelevich, Po‐Shen Loh   +2 more
openalex   +1 more source

Perfect matchings in 4-uniform hypergraphs

Journal of Combinatorial Theory, Series B, 2016
A perfect matching in a 4-uniform hypergraph is a subset of $\lfloor\frac{n}{4}\rfloor$ disjoint edges. We prove that if $H$ is a sufficiently large 4-uniform hypergraph on $n=4k$ vertices such that every vertex belongs to more than ${n-1\choose 3} - {3n/4 \choose 3}$ edges then $H$ contains a perfect matching.
openaire   +3 more sources