Hostname: page-component-cd9895bd7-dzt6s Total loading time: 0 Render date: 2024-12-26T00:51:59.083Z Has data issue: false hasContentIssue false
  • English
  • Français

Non-Existence Criteria for Small Configurations

Published online by Cambridge University Press:  20 November 2018

Judith Q. Longyear
Judith Q. Longyear*
Affiliation:
Pennsylvania State University, University Park, Pennsylvania
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

For graph theoretic terms, see Tutte [1], A rank 2 tactical configuration of girth 2g and order (s, t) may be regarded as a (1 + s, 1 + t)-regular bipartite graph of girth 2g. We assume s ≦ t. Using a technique of Friedman [2] we show (i) and (ii).

Type
Research Article
Information
Canadian Journal of Mathematics , Volume 25 , Issue 1 , February 1973 , pp. 213 - 215
Copyright
Copyright © Canadian Mathematical Society 1973

References

1. Tutte, W., Connectivity in graphs (University of Toronto Press, Toronto, 1966).Google Scholar
2. Friedman, H., On the impossibility of certain Moore graphs, J. Combinatorial Theory 10B (1971), 245-253.Google Scholar
3. Feit, W. and Higman, G., The non-existence of certain generalized polygons, J. Algebra 1 (1964), 114–131.Google Scholar