Binomial partial Steiner triple systems containing complete graphs

DOI10.1007/S00373-016-1681-3MaRDI QIDQ343768zbMATH OpenOpenAlexWikidataFDO

Authors M. Prażmowska, K. Prażmowski

Publication date 29 November 2016

Published in Graphs and Combinatorics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

complete graphbinomial configurationgeneralized Desargues configuration

Mathematics Subject Classification ID

Other designs, configurations (05B30) Combinatorial aspects of packing and covering (05B40) Graph designs and isomorphic decomposition (05C51)

Abstract: We propose a new approach to studies on partial Steiner triple systems consisting in determining complete graphs contained in them. We establish the structure which complete graphs yield in a minimal PSTS that contains them. As a by-product we introduce the notion of a binomial PSTS as a configuration with parameters of a minimal PSTS with a complete subgraph. A representation of binomial PSTS with at least a given number of its maximal complete subgraphs is given in terms of systems of perspectives. Finally, we prove that for each admissible integer there is a binomial PSTS with this number of maximal complete subgraphs.

Recommendations

• Embedding partial Steiner triple systems with few triples
• scientific article; zbMATH DE number 4068926
• On partial parallel classes in partial Steiner triple systems
• Maximum partial triple systems on 16 and 17 points
• Complete arcs in Steiner triple systems

Cites work

• scientific article; zbMATH DE number 468607 (Why is no real title available?)
• scientific article; zbMATH DE number 5587321 (Why is no real title available?)
• Adjacency in generalized projective Veronese spaces
• Classification of triangle-free \(22_3\) configurations
• Combinatorial Veronese structures, their geometry, and problems of embeddability
• Configurations and their realization
• Construction Techniques for Anti-Pasch Steiner Triple Systems
• DESARGUESIAN CLOSURE OF BINOMIAL GRAPHS
• Desargues maps and the Hirota-Miwa equation
• Geometric realization of some triangle-free combinatorial configurations \(22_3\)
• Infinite classes of anti‐mitre and 5‐sparse Steiner triple systems
• Multiple perspectives and generalizations of the Desargues configuration
• On 6-sparse Steiner triple systems
• On the existence of projective embeddings of multiveblen configurations
• Small triangle-free configurations of points and lines
• Some generalization of Desargues and Veronese configurations
• The 10-cages and derived configurations
• The affine Weyl group symmetry of Desargues maps and of the non-commutative Hirota-Miwa system
• The resolution of the anti‐mitre Steiner triple system conjecture
• Twisted Fano spaces and their classification, linear completions of systems of triangle perspectives
• \(10_3\)-configurations and projective realizability of multiplied configurations

Cited in

(6)

• scientific article; zbMATH DE number 1052829 (Why is no real title available?)
• Pascal Triangle and Properties of Bipartite Steinhaus Graphs
• Complementary partial resolution squares for Steiner triple systems
• Partitioning Steiner triple systems into complete arcs
• A complete classification of the \((15_4 20_3)\)-configurations with at least three \(K_5\)-graphs
• Complete arcs in Steiner triple systems

This page was built for publication: Binomial partial Steiner triple systems containing complete graphs

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