Characterising Near Continuity Constructively
✍ Scribed by Douglas Bridges; Luminiţa Vîţă
- Publisher
- John Wiley and Sons
- Year
- 2001
- Tongue
- English
- Weight
- 107 KB
- Volume
- 47
- Category
- Article
- ISSN
- 0044-3050
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
A graph is 1-extendible if every edge has a 1-factor containing it. A 1-extendible non-bipartite graph G is said to be near bipartite if there exist edges e 1 and e 2 such that G&[e 1 , e 2 ] is 1-extendible and bipartite. We characterise the Pfaffian near bipartite graphs in terms of forbidden subg
We give a construction which takes a rank two incidence geometry with three points on a line and returns a geometry of the same type, i.e., with three points on a line. It is also demonstrated that embeddings of the original geometry can be extended to the new geometry. It is shown that the family o