Supersolvable frame-matroid and graphic-lift lattices
From MaRDI portal
Publication:1840839
DOI10.1006/eujc.2000.0418zbMath0966.05013OpenAlexW2035232459MaRDI QIDQ1840839
Publication date: 12 August 2001
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/379dc88af4a1b79fb0b794115033a8e88fd0c5bb
arrangement of hyperplanesbiased graphsupersolvable geometric latticelink graphlift matroidframe-matroidJ. G. Oxley
Related Items
Signed graphs and the freeness of the Weyl subarrangements of type \(B_\ell\), A generalization of semimodular supersolvable lattice, Biased expansions of biased graphs and their chromatic polynomials, Biased graphs IV: Geometrical realizations, Comments on ``Supersolvable frame-matroid and graphic-lift lattices by T. Zaslavsky [European Journal of Combinatorics 22 (2001) 119], Modular construction of free hyperplane arrangements, A characterization of signed graphs with generalized perfect elimination orderings, Infinitely many excluded minors for frame matroids and for lifted-graphic matroids, The Dowling transform of subspace arrangements
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Biased graphs. I: Bias, balance, and gains
- Factorizations of the Orlik-Solomon algebras
- Free hyperplane arrangements between \(A_{n-1}\) and \(B_ n\)
- Frame matroids and biased graphs
- On free deformations of the braid arrangement
- The number of elements in a generalized partition semilattice
- Threshold graphs and related topics
- A generalization of semimodular supersolvable lattice
- Modular elements of geometric lattices
- A class of geometric lattices based on finite groups
- Supersolvable lattices
- Erratum to ``A class of geometric lattices based on finite groups
- Varieties of Combinatorial Geometries
- Modular Constructions for Combinatorial Geometries
- Hyperplane arrangements, interval orders, and trees.
