Graphical t-designs via polynomial Kramer-Mesner matrices

DOI10.1016/S0012-365X(99)90045-6zbMATH Open0936.05011OpenAlexW4210284507MaRDI QIDQ1292815FDOQ1292815

Authors: Anton Betten, Alfred Wassermann, Mikhail H. Klin, Reinhard Laue 

Publication date: 25 May 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(99)90045-6

Recommendations

• An improved finiteness theorem for graphical \(t\)-designs
• Block designs with prescribed automorphism group
• Graphical \(t\)-designs with block sizes three and four

zbMATH Keywords

symmetric groupmaximal subgroupgraphical \(t\)-designsKramer-Mesner matrices

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Subgroups of symmetric groups (20B35)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A classification of the maximal subgroups of the finite alternating and symmetric groups
• t-designs on hypergraphs
• Parallel concepts in graph theory
• Title not available (Why is that?)
• Block-transitive \(t\)-designs. I: Point-imprimitive designs
• Graphical t-wise balanced designs
• On graphical quintuple systems
• Simple \(8\)-designs with small parameters
• The existence of a simple 3-(28,5,30) design
• Zu einem Isomorphiesatz von H. Whitney für Graphen
• Title not available (Why is that?)
• An \(S_ 3(3,5,21)\) using graphs
• Title not available (Why is that?)
• Graphical \(t\)-designs with block sizes three and four
• On the construction of block designs
• Title not available (Why is that?)
• The t‐designs with prescribed automorphism group, new simple 6‐designs
• Title not available (Why is that?)

Cited In (9)

• Search for combinatorial objects using lattice algorithms -- revisited
• A combinatorial approach to transitive extensions of generously unitransitive permutation groups
• An improved finiteness theorem for graphical \(t\)-designs
• Title not available (Why is that?)
• Hypergraphical \(t\)-designs
• New Infinite Families of 2-Edge-Balanced Graphs
• Design of designs
• An enumeration of graphical designs
• The Paulus-Rozenfeld-Thompson graph on 26 vertices revisited and related combinatorial structures

Uses Software

• DISCRETA

This page was built for publication: Graphical \(t\)-designs via polynomial Kramer-Mesner matrices

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