Reductions of (v_3) configurations

Simple item page
dc.creatorBoben, Marko
dc.date2005-05-08
dc.date.accessioned2026-07-07T05:19:42Z
dc.date.available2026-07-07T05:19:42Z
dc.descriptionCubic bipartite graphs with girth at least 6 correspond to symmetric combinatorial (v_3) configurations. In 1887 V. Martinetti described a simple reduction method which enables one to reduce each combinatorial (v_3) 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 (v_3) configuration either to the Fano configuration or to the Pappus configuration.
dc.identifierhttps://arxiv.org/abs/math/0505136
dc.identifierhttp://arxiv.org/abs/math/0505136
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/75113
dc.subjectCombinatorics
dc.subject05C62, 05C85, 05R05, 68R10
dc.titleReductions of (v_3) configurations
dc.typetext

Files

Collections

arXiv