Sampling complete designs

DOI10.1016/J.DISC.2011.02.034MaRDI QIDQ658083zbMATH OpenOpenAlexFDO

Authors Anita Pasotti, Luca Giuzzi

Publication date 11 January 2012

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0907.3199

zbMATH Keywords

complete graphembedding of designs

Mathematics Subject Classification ID

Other designs, configurations (05B30) Structural characterization of families of graphs (05C75)

Abstract: In the present paper, complete designs of graphs are considered. The notion of (regular) sampling is introduced and analyzed in detail, showing that the trivial necessary condition for its existence is actually sufficient. Some examples are also provided.

Recommendations

• On regular embedding of \(H\)-designs into \(G\)-designs
• Embedding Partial Graph Designs, Block Designs, and Triple Systems with λ > 1
• Bounded complete embedding graphs
• scientific article; zbMATH DE number 2061156
• Exact embedding of two \(G\)-designs into a \((G+e)\)-design

Cites work

• scientific article; zbMATH DE number 4210147 (Why is no real title available?)
• scientific article; zbMATH DE number 4212104 (Why is no real title available?)
• scientific article; zbMATH DE number 22652 (Why is no real title available?)
• scientific article; zbMATH DE number 54786 (Why is no real title available?)
• scientific article; zbMATH DE number 3520420 (Why is no real title available?)
• scientific article; zbMATH DE number 1219592 (Why is no real title available?)
• scientific article; zbMATH DE number 2061156 (Why is no real title available?)
• scientific article; zbMATH DE number 3258084 (Why is no real title available?)
• scientific article; zbMATH DE number 2230935 (Why is no real title available?)
• 2-\((v,k,\lambda)\) designs of small order
• Combinatorial theory.
• Cyclic designs with block size 4 and related optimal optical orthogonal codes
• Embedding Steiner triple systems in hexagon triple systems
• Embedding Steiner triple systems into Steiner systems \(S(2,4,v)\).
• Embedding balanced \(P_{3}\)-designs into (balanced) \(P_{4}\)-designs
• Embedding handcuffed designs in \(D\)-designs, where \(D\) is the triangle with attached edge
• Embedding handcuffed designs with block size 2 or 3 in 4-cycle systems
• Embedding path designs in 4-cycle systems
• Embeddings of simple maximum packings of triples with \(\lambda\) even
• Graph theory. Foreword by Crispin St. J. A. Nash-Williams.
• Matching theory
• Minimum embedding of P3-designs into (K4?e)-designs
• Minimum embedding of Steiner triple systems into \((K_4 - e)\)-designs. II
• Minimum embedding of \(P_{3}\)-designs into \(\mathrm{TS}(v,\lambda )\)
• Nesting directed cycle systems of even length
• Nesting of cycle systems of odd length
• On Representatives of Subsets
• Parallel concepts in graph theory

Cited in

(1)

• Simple Latin Square Sampling ±kDesigns

Describes a project that uses

Uses Software

• GAP

This page was built for publication: Sampling complete designs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q658083)