2005/05/08 by Marko Boben, Boben, Marko
Computer Science · Engineering · Mathematics · #05C62 #05C85 #05R05 #68R10 #Coding theory and cryptography #Combinatorics (math.CO) #FOS: Mathematics #Finite Group Theory Research #graph theory and CDMA systems #math.CO #msc:05C62 #msc:05C85 #msc:05R05 #msc:68R10
paper · pdf · doi:10.48550/arxiv.math/0505136
arxiv created 2005/05/08 · openalex publication_date 2005/05/08 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.