Biased graphs. VI: Synthetic geometry

DOI10.1016/j.ejc.2019.03.006zbMath1420.05030arXiv1608.06021OpenAlexW2963206538MaRDI QIDQ2323088

Thomas Zaslavsky, Rigoberto Flórez

Publication date: 30 August 2019

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1608.06021

zbMATH Keywords

arrangement of hyperplanescharacteristic polynomialgeometric semilatticethick biased graph

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Combinatorial aspects of matroids and geometric lattices (05B35) Incidence structures embeddable into projective geometries (51A45) Signed and weighted graphs (05C22)

Related Items (1)

The Projective Planarity Question for Matroids of $3$-Nets and Biased Graphs

Cites Work

• Associativity in multiary quasigroups: The way of biased expansions
• Biased graphs. I: Bias, balance, and gains
• Biased graphs. II: The three matroids
• Frame matroids and biased graphs
• Biased graphs IV: Geometrical realizations
• A class of geometric lattices based on finite groups
• A certain generalization of the theorems of Menelaos and Ceva
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Biased graphs. VI: Synthetic geometry