Reductions of (v3) configurations
Abstract
Cubic bipartite graphs with girth at least 6 correspond to symmetric combinatorial (v3) configurations. In 1887 V. Martinetti described a simple reduction method which enables one to reduce each combinatorial (v3) configuration to one from the infinite set of so-called irreducible configurations. The aim of this paper is to show that a slightly extended set of reductions enables one to reduce each combinatorial (v3) configuration either to the Fano configuration or to the Pappus configuration.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.