Steiner Triple Systems and Existentially Closed Graphs
暂无分享,去创建一个
[1] Yuichiro Fujiwara,et al. Constructions for anti‐mitre Steiner triple systems , 2005 .
[2] Anthony Bonato,et al. Hadamard Matrices and Strongly Regular Graphs with the 3-e.c. Adjacency Property , 2001, Electron. J. Comb..
[3] P. Erdös. ASYMMETRIC GRAPHS , 2022 .
[4] L. Caccetta,et al. A PROPERTY OF RANDOM GRAPHS , 2001 .
[5] Yuichiro Fujiwara,et al. Infinite classes of anti‐mitre and 5‐sparse Steiner triple systems , 2006 .
[6] Douglas R. Stinson. Hill-Climbing Algerithms for the Construction of Combinatorial Designs , 1985 .
[7] Béla Bollobás,et al. Graphs which Contain all Small Graphs , 1981, Eur. J. Comb..
[8] N. Sauer,et al. Maximal Subsets of a given Set having No Triple in Common with a Steiner Triple System on the set , 1969, Canadian Mathematical Bulletin.
[9] T. S. Griggs,et al. Configurations in Steiner triple systems , 1999 .
[10] Mike J. Grannell,et al. A small basis for four‐line configurations in steiner triple systems. Dedicated to the memory of gemma holly griggs , 1995 .
[11] Charles J. Colbourn,et al. Construction Techniques for Anti‐Pasch Steiner Triple Systems , 2000 .
[12] Mike J. Grannell,et al. The Resolution of the Anti-Pasch Conjecture , 2000 .
[13] Patric R. J. Östergård,et al. The Steiner triple systems of order 19 , 2004, Math. Comput..
[14] Adam J. Wolfe,et al. The resolution of the anti‐mitre Steiner triple system conjecture , 2006 .
[15] Douglas R. Stinson,et al. Some results on quadrilaterals in Steiner triple systems , 1992, Discret. Math..
[16] Anthony Duncan Forbes. Configurations and colouring problems in block designs , 2006 .
[17] Frank Harary,et al. Paley graphs satisfy all first-order adjacency axioms , 1981, J. Graph Theory.
[18] Charles J. Colbourn,et al. Anti-mitre steiner triple systems , 1994, Graphs Comb..
[19] Lou Caccetta,et al. On the adjacency properties of paley graphs , 1993, Networks.
[20] A. D. Forbes,et al. Configurations and trades in Steiner triple systems , 2004, Australas. J Comb..