✦ LIBER ✦

Orbits in uniform hypergraphs

✍ Scribed by Anne Delandtsheer

Book ID: 103056645
Publisher: Elsevier Science
Year: 1986
Tongue: English
Weight: 164 KB
Volume: 61
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(86)90103-2

No coin nor oath required. For personal study only.

✦ Synopsis

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).

📜 SIMILAR VOLUMES

Spectra of uniform hypergraphs

✍ Joshua Cooper; Aaron Dutle 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 410 KB

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

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

Transversals and domination in uniform h

Transversals and domination in uniform hypergraphs

✍ Csilla Bujtás; Michael A. Henning; Zsolt Tuza 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 235 KB

Approximate Set Covering in Uniform Hype

Approximate Set Covering in Uniform Hypergraphs

✍ Michael Krivelevich 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 296 KB

The weighted set covering problem, restricted to the class of r-uniform hypergraphs, is considered. We propose a new approach, based on a recent result of Aharoni, Holzman, and Krivelevich about the ratio of integer and fractional covering numbers in k-colorable r-uniform hypergraphs. This approach,