✦ LIBER ✦

Detachments of Amalgamated 3-Uniform Hypergraphs Factorization Consequences

✍ Scribed by M. Amin Bahmanian

Book ID: 112120487
Publisher: John Wiley and Sons
Year: 2012
Tongue: English
Weight: 700 KB
Volume: 20
Category: Article
ISSN: 1063-8539
DOI: 10.1002/jcd.21310

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Embedding Factorizations for 3-Uniform H

Embedding Factorizations for 3-Uniform Hypergraphs

✍ Amin Bahmanian; Chris Rodger 📂 Article 📅 2012 🏛 John Wiley and Sons 🌐 English ⚖ 559 KB

Spanning trees of 3-uniform hypergraphs

✍ Andrew Goodall; Anna de Mier 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 436 KB

Judicious Partitions of 3-uniform Hyperg

Judicious Partitions of 3-uniform Hypergraphs

✍ B. Bollobás; A.D. Scott 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 113 KB

A conjecture of Bollobás and Thomason asserts that, for r ≥ 1, every r -uniform hypergraph with m edges can be partitioned into r classes such that every class meets at least rm/(2r -1) edges. Bollobás, Reed and Thomason [3] proved that there is a partition in which every edge meets at least (1 -1/e

Hamilton decompositions of complete 3-un

Hamilton decompositions of complete 3-uniform hypergraphs

✍ Helen Verrall 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 947 KB

The problem of finding a Hamilton decomposition of the complete 3-uniform hypergraph K,3 has been solved for n = 2 (mod 3) and n = 4(mod 6) . We find here a Hamilton decomposition of Ki, no l(mod 6), and a Hamilton decomposition of the complete 3-uniform hypergraph minus a l-factor, Ki -I, n = 0 (mo

The chromatic spectrum of 3-uniform bi-h

The chromatic spectrum of 3-uniform bi-hypergraphs

✍ Ping Zhao; Kefeng Diao; Kaishun Wang 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 222 KB

On line graphs of linear 3-uniform hyper

On line graphs of linear 3-uniform hypergraphs

✍ Metelsky, Yury; Tyshkevich, Regina 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 154 KB 👁 2 views

It is known that the class of line graphs of linear 3-uniform hypergraphs cannot be characterized by a finite list of forbidden induced subgraphs (R. N.