Name
Abstract | ||
|---|---|---|
An $(n_k)$-configuration is a set of $n$ points and $n$ lines in the projective plane such that their point-line incidence graph is $k$-regular. The configuration is geometric, topological, or combinatorial depending on whether lines are considered to be straight lines, pseudolines, or just combinatorial lines. We provide an algorithm for generating, for given $n$ and $k$, all topological $(n_k)$-configurations up to combinatorial isomorphism, without enumerating first all combinatorial $(n_k)$-configurations. We apply this algorithm to confirm efficiently a former result on topological $(18_4)$-configurations, from which we obtain a new geometric $(18_4)$-configuration. Preliminary results on $(19_4)$-configurations are also briefly reported. |
Year | Venue | Field |
|---|---|---|
2012 | Computational Geometry: Theory and Applications | Topology,Discrete mathematics,Graph,Combinatorics,Isomorphism,Projective plane,Mathematics |
DocType | Volume | ISSN |
Journal | abs/1210.0306 | Comput. Geom., 47(2):175-186, 2014 |
Citations | PageRank | References |
1 | 0.45 | 3 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jürgen Bokowski | 1 | 159 | 27.72 |
| Vincent Pilaud | 2 | 57 | 10.15 |