Results 101 to 110 of about 698,372 (216)

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

The Ramsey Number for 3-Uniform Tight Hypergraph Cycles

, 2009
Let C(3)n denote the 3-uniform tight cycle, that is, the hypergraph with vertices v1, .–.–., vn and edges v1v2v3, v2v3v4, .–.–., vn−1vnv1, vnv1v2. We prove that the smallest integer N = N(n) for which every red–blue colouring of the edges of the complete
Haxell, Penny, Rodl, V, Rucinski, Andrzej, Skokan, Jozef, Łucak, T, Peng, Y   +5 more
core   +1 more source

The Ramsey number for hypergraph cycles I [PDF]

, 2006
Let Cn denote the 3-uniform hypergraph loose cycle, that is the hypergraph with vertices v1,…,vn and edges v1v2v3, v3v4v5, v5v6v7,…,vn-1vnv1. We prove that every red-blue colouring of the edges of the complete 3-uniform hypergraph with N vertices ...
Rödl, V., Simonovits, M., Ruciński, A., Skokan, J., Haxell, P.E., Łuczak, T., Peng, Y.   +6 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

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   +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

Hypergraph regularity and higher arity VC-dimension [PDF]

, 2020
We generalize the fact that graphs with small VC-dimension can be approximated by rectangles, showing that hypergraphs with small VC_k-dimension (equivalently, omitting a fixed finite (k+1)-partite (k+1)-uniform hypergraph) can be approximated by k-ary ...
Chernikov, Artem, Towsner, Henry
core   +1 more source

Linear trees in uniform hypergraphs

European Journal of Combinatorics, 2014
Given a tree T on v vertices and an integer k exceeding one. One can define the k-expansion T^k as a k-uniform linear hypergraph by enlarging each edge with a new, distinct set of (k-2) vertices. Then T^k has v+ (v-1)(k-2) vertices. The aim of this paper is to show that using the delta-system method one can easily determine asymptotically the size of ...
openaire   +3 more sources

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   +3 more sources

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