1 citations · 2 across the 10 of their papers we have counts for
10 papers
An elementary chromatic reduction for gain graphs and special hyperplane arrangements
Pascal Berthome, Raul Cordovil, David Forge +2
A gain graph is a graph whose edges are labelled invertibly by "gains" from a group. "Switching" is a transformation of gain graphs that generalizes conjugation in a group. A "weak…
Dirac's theorem on simplicial matroids
Raul Cordovil, Manoel Lemos, Claudia Linhares Sales
We introduce the notion of k-hyperclique complexes, i.e., the largest simplicial complexes on the set [n] with a fixed k-skeleton. These simplicial complexes are a higher-dimension…
An Orlik-Solomon type algebra for matroids with a fixed linear class of circuits
Raul Cordovil, David Forge
A family C of circuits of a matroid M is a linear class if, given a modular pair of circuits in C}, any circuit contained in the union of the pair is also in C. The pair (M,C) can…
Kalai orientations on matroid polytopes
Raul Cordovil
Let P a polytope and let G(P) be the graph of P. Following Gil Kalai, we say that an acyclic orientation O of G(P) is good if, for every non-empty face F of P, the induced graph G(…
A note on mixed graphs and matroids
J. Orestes Cerdeira, Raul Cordovil
A mixed graph is a graph with some directed edges and some undirected edges. We introduce the notion of mixed matroids as a generalization of mixed graphs. A mixed matroid can be v…
How is a Chordal Graph like a Supersolvable Binary Matroid?
Raul Cordovil, David Forge, Sulamita Klein
Let G be a finite simple graph. From the pioneering work of R. P. Stanley it is known that the cycle matroid of G is supersolvable iff G is chordal (rigid): this is another way to…