Binomial partial Steiner triple systems containing complete graphs

DOI10.1007/S00373-016-1681-3zbMATH Open1349.05048arXiv1404.4064OpenAlexW1793164117WikidataQ59473849 ScholiaQ59473849MaRDI QIDQ343768FDOQ343768

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

Publication date: 29 November 2016

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

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.

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

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

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)

Cites Work

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

Cited In (6)

• Complementary partial resolution squares for Steiner triple systems
• A complete classification of the \((15_4 20_3)\)-configurations with at least three \(K_5\)-graphs
• Pascal Triangle and Properties of Bipartite Steinhaus Graphs
• Partitioning Steiner triple systems into complete arcs
• Complete arcs in Steiner triple systems
• Title not available (Why is that?)

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)