Incidence structures near configurations of type (n₃)
From MaRDI portal
Abstract: An configuration is an incidence structure equivalent to a linear hypergraph on vertices which is both 3-regular and 3-uniform. We investigate a variant in which one constraint, say 3-regularity, is present, and we allow exactly one line to have size four, exactly one line to have size two, and all other lines to have size three. In particular, we study planar (Euclidean or projective) representations, settling the existence question and adapting Steinitz' theorem for this setting.
Recommendations
Cites work
Cited in
(8)- Structure of Bernstein populations of type (3,n-3)
- Counting symmetric configurations \(v_3\)
- On triangular matroids induced by \(n_3\)-configurations
- Configurations containing a given linear hypergraph
- scientific article; zbMATH DE number 3893896 (Why is no real title available?)
- A 10_3 configuration that is almost a theorem
- 3-connected configurations \((n_3)\) with no Hamiltonian circuit
- On the incidence graph of circular spaces
This page was built for publication: Incidence structures near configurations of type \((n_3)\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4993940)