𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Hamilton cycles in block-intersection graphs of triple systems

✍ Scribed by Peter Horák; David A. Pike; Michael E Raines

Publisher
John Wiley and Sons
Year
1999
Tongue
English
Weight
336 KB
Volume
7
Category
Article
ISSN
1063-8539

No coin nor oath required. For personal study only.

✦ Synopsis

Given a BIBD S = (V, B), its 1-block-intersection graph GS has as vertices the elements of B; two vertices B1, B2 ∈ B are adjacent in GS if |B1 ∩ B2| = 1. If S is a triple system of arbitrary index λ, it is shown that GS is hamiltonian.

📜 SIMILAR VOLUMES

Intersections of longest cycles in grid
Intersections of longest cycles in grid graphs
✍ Menke, B.; Zamfirescu, T.; Zamfirescu, C. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 292 KB 👁 2 views

It is well-known that the largest cycles of a graph may have empty intersection. This is the case, for example, for any hypohamiltonian graph. In the literature, several important classes of graphs have been shown to contain examples with the above property. This paper investigates a (nontrivial) cl

On cliques in spanning graphs of project
On cliques in spanning graphs of projective Steiner triple systems
✍ Frantisek Franek 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 129 KB 👁 2 views

We are interested in the sizes of cliques that are to be found in any arbitrary spanning graph of a Steiner triple system S S. In this paper we investigate spanning graphs of projective Steiner triple systems, proving, not surprisingly, that for any positive integer k and any suf®ciently large proje

Edge disjoint Hamilton cycles in sparse
Edge disjoint Hamilton cycles in sparse random graphs of minimum degree at leastk
✍ Bollob�s, B.; Cooper, C.; Fenner, T. I.; Frieze, A. M. 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 175 KB 👁 2 views

Let G n,m,k denote the space of simple graphs with n vertices, m edges, and minimum degree at least k, each graph G being equiprobable. Let G have property A k , if G contains (k -1)/2 edge disjoint Hamilton cycles, and, if k is even, a further edge disjoint matching of size n/2 . We prove that, for