Counting symmetric configurations v₃
An incidence geometry \((P,{\mathcal B})\) consists of a set of \(v\) points \(P= \{p_1,\dots, p_v\}\) and a collection of \(b\) blocks \({\mathcal B}= \{B_1,\dots, B_b\}\) such that \(B_i\subseteq P\) for \(i= 1,2,\dots, b\). The number of blocks containing a point \(p\in P\) is called the degree, denoted by \([p]\). Blocks are also called lines and \(|B|\) is called the length of the block \(B\). A pair \((p,B)\) with \(p\in B\in{\mathcal B}\) is called a flag. In this case, the point \(p\) is said to lie on the line \(B\). The line is said to pass through \(p\). Additionally, in an incidence geometry any pair of points is joined by at most one line, i.e., \(|B_i\cap B_j|\leq 1\) for all \(i, j\in\{1,\dots, b\}\), \(i\neq j\). An incidence geometry \((p,{\mathcal B})\) is called configuration of type \((v_r,b_k)\) if (1) \(|B_j|= k\) for \(j= 1,2,\dots, b\) and (2) \([p_i]= r\) for \(i= 1,2,\dots, v\). A configuration \((p,{\mathcal B})\) with \(v= b\) is called symmetric. Its type is simply denoted by \(v_r\) which is the same as \(b_k\) because \(k= r\) in this case. A configuration \(C= (p,{\mathcal B})\) is called decomposable if it can be written as the union of two configurations \(C_1\), \(C_2\) on distinct point sets: \(C_1= (p_1,{\mathcal B}_1)\), \(C_2= (p_2,{\mathcal B}_2)\), and \(P= P_1\cup P_2\) and \({\mathcal B}= {\mathcal B}_1\cup{\mathcal B}_2\). Indecomposable configurations are also called connected. The isomorphisms are structure preserving mappings. A triangle of a configuration consists of three points, say \(a\), \(b\), and \(c\), such that the three pairs \(\{a,b\}\), \(\{b,c\}\), \(\{c,a\}\) are contained in different blocks. A configuration that has no triangles is called a triangle-free configuration. An isomorphism \(C\to C^d\) is called an anti-automorphism. A configuration which admits an anti-automorphism is called self-dual. An anti-automorphism of order \(2\) is called a polarity. A configuration which admits a polarity is called self-polar. The authors give tables of configurations \(v_3\) for \(v\leq 18\) and triangle-free configurations for \(v\leq 21\) together with some statistics about some properties of structures like transitivity, self-duality or self-polarity.
- Blocking set free configurations and their relations to digraphs and hypergraphs
- Configurations and graphs. II
- Fast generation of cubic graphs
- scientific article; zbMATH DE number 867473 (Why is no real title available?)
- scientific article; zbMATH DE number 3257050 (Why is no real title available?)
- Regular linear spaces
- Self-dual configurations and regular graphs
- Topological configurations (n₄) exist for all n 17
- The 10-cages and derived configurations
- Configurations between geometry and combinatorics.
- Multilaterals in configurations
- On some infinite series of \((r,1)\)-designs
- On triangular matroids induced by \(n_3\)-configurations
- Strongly regular configurations
- On applications of bipartite graph associated with algebraic structures
- On the upper embedding of symmetric configurations with block size 3
- Classification of \({(v,3)}\)-configurations
- Small triangle-free configurations of points and lines
- Projective, affine, and abelian colorings of cubic graphs
- A construction for a counterexample to the pseudo 2-factor isomorphic graph conjecture
- Some Topics in Graph Theory
- Locally arc-transitive graphs of valence \(\{3,4\}\) with trivial edge kernel
- Enumerating topological (n_k)-configurations
- Generation of various classes of trivalent graphs
- Geometric constructions for symmetric 3-configurations
- The semigroup of combinatorial configurations
- Geometric realization of some triangle-free combinatorial configurations \(22_3\)
- Coordinatizing n₃ configurations
- Coverings of configurations, prime configurations, and orbiconfigurations
- On a smallest topological triangle free (n₄) point-line configuration
- scientific article; zbMATH DE number 7603373 (Why is no real title available?)
- Fragments in symmetric configurations with block size 3
- The number of cyclic configurations of type \((v_{3})\) and the isomorphism problem
- Rotary polygons in configurations
- scientific article; zbMATH DE number 2191979 (Why is no real title available?)
- scientific article; zbMATH DE number 2230320 (Why is no real title available?)
- Classification of triangle-free 22_3 configurations
- Variations on Ramsey numbers and minimum numbers of monochromatic triangles in line 2-colorings of configurations
- Algorithms and complexity for counting configurations in Steiner triple systems
- Steiner triple systems of order 21 with subsystems
- Colouring problems for symmetric configurations with block size 3
- Constructing highly incident configurations
- Graphs connected to isotopes of inverse property quasigroups: a few applications
- On the impossibility of certain \((n^2+ n + k_{n+1})\) configurations
- The configurations \(12_{3}\) revisited
- Irreducible \((v_{3})\) configurations and graphs
- A classification of cubic bicirculants
This page was built for publication: Counting symmetric configurations \(v_3\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1962053)
