✦ LIBER ✦

Spectra of uniform hypergraphs

✍ Scribed by Joshua Cooper; Aaron Dutle

Book ID: 113772188
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 410 KB
Volume: 436
Category: Article
ISSN: 0024-3795
DOI: 10.1016/j.laa.2011.11.018

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Partitioning 3-uniform hypergraphs

✍ Jie Ma; Xingxing Yu 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 291 KB

Saturated r-uniform hypergraphs

✍ Paul Erdős; Zoltán Füredi; Zsolt Tuza 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 708 KB

ErdGs, P., Z. Fiiredi and Z. Tuza, Saturated r-uniform hypergraphs, Discrete Mathematics 98 (1991) 95-104. The following dual version of Turin's problem is considered: for a given r-uniform hypergraph F, determine the minimum number of edges in an r-uniform hypergraph H on n vertices, such that F

Orbits in uniform hypergraphs

✍ Anne Delandtsheer 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 164 KB

Given two integers ~r > 0 and fl >I 0, we prove that there exists a finite k-uniform hypergraph (resp. a finite connected k-uniform hypergraph) whose automorphism group has exactly ~r point orbits and fl block orbits if and only if :r ~< kfl + 1 (resp. :r ~< (k -1)fl + 1).

Covering Non-uniform Hypergraphs

✍ Endre Boros; Yair Caro; Zoltán Füredi; Raphael Yuster 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 160 KB

A subset of the vertices in a hypergraph is a cover if it intersects every edge. Let {(H) denote the cardinality of a minimum cover in the hypergraph H, and let us denote by g(n) the maximum of {(H) taken over all hypergraphs H with n vertices and with no two hyperedges of the same size. We show tha

Transversal numbers of uniform hypergrap

Transversal numbers of uniform hypergraphs

✍ Noga Alon 📂 Article 📅 1990 🏛 Springer Japan 🌐 English ⚖ 220 KB

Decomposition of large uniform hypergrap

Decomposition of large uniform hypergraphs

✍ Zbigniew Lonc; Miroslaw Truszczyński 📂 Article 📅 1985 🏛 Springer Netherlands 🌐 English ⚖ 294 KB