✦ LIBER ✦

A proof of Lindner's conjecture on embeddings of partial Steiner triple systems

✍ Scribed by Darryn Bryant; Daniel Horsley

Publisher: John Wiley and Sons
Year: 2009
Tongue: English
Weight: 243 KB
Volume: 17
Category: Article
ISSN: 1063-8539
DOI: 10.1002/jcd.20189

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

Lindner's conjecture that any partial Steiner triple system of order u can be embedded in a Steiner triple system of order v if $v\equiv 1,3 ; ({\rm mod}; 6)$ and $v\geq 2u+1$ is proved. © 2008 Wiley Periodicals, Inc. J Combin Designs 17: 63–89, 2009

📜 SIMILAR VOLUMES

A conjecture on small embeddings of part

A conjecture on small embeddings of partial Steiner triple systems

✍ Darryn Bryant 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 106 KB 👁 1 views

## Abstract A well‐known, and unresolved, conjecture states that every partial Steiner triple system of order __u__ can be embedded in a Steiner triple system of order υ for all υ ≡ 1 or 3, (mod 6), υ ≥ 2u + 1. However, some partial Steiner triple systems of order __u__ can be embedded in Steiner t

Cyclic bi-embeddings of Steiner triple s

Cyclic bi-embeddings of Steiner triple systems on 12s + 7 points

✍ G. K. Bennett; M. J. Grannell; T. S. Griggs 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 196 KB 👁 1 views

## Abstract A cyclic face 2‐colourable triangulation of the complete graph __K__~__n__~ in an orientable surface exists for __n__ ≡ 7 (mod 12). Such a triangulation corresponds to a cyclic bi‐embedding of a pair of Steiner triple systems of order __n__, the triples being defined by the faces in eac

On the number of partial Steiner systems

✍ A. S. Asratian; N. N. Kuzjurin 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 101 KB 👁 2 views

Proof of a Conjecture of Bollob?s on Nes

Proof of a Conjecture of Bollob?s on Nested Cycles

✍ Guantao Chen; Paul Erdós; William Staton 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 221 KB

For any positive integer k, a minimum degree condition is obtained which forces a graph to have k edge-disjoint cycles C 1 , C 2 , ..., C k such that V(C 1

A Proof of Hozo's Conjecture on the Homo

A Proof of Hozo's Conjecture on the Homology of a Class of Nilpotent Lie Algebras

✍ Phil Hanlon 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 342 KB

a poset by saying u F ¨if u is on the path from r to ¨. Let Z P be the span of all matrices z such that u -¨, where z is the n = n matrix with a 1 in the u, ü¨P u ẅ x Ž .

Proof of a Conjecture of Mader, Erdös an

Proof of a Conjecture of Mader, Erdös and Hajnal on Topological Complete Subgraphs

✍ B. Bollobás; A. Thomason 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 89 KB

We show that every graph G of size at least 256 p 2 |G| contains a topological complete subgraph of order p. This slight improvement of a recent result of Komlós and Szemerédi proves a conjecture made by Mader and by Erdös and Hajnal.