9 search results - page 1 / 2 » ejc 2011 |
EJC
2011
12 years 11 months ago
2011
EJC
2011
12 years 11 months ago
2011
Abstract. We introduce a new axiomatization of oriented matroids that requires the elimination property only among modular pairs of circuits. This new point of view leads also to a...
EJC
2011
12 years 11 months ago
2011
Henning and Yeo proved a lower bound for the minimum size of a maximum matching in a connected k-regular graphs with n vertices; it is sharp infinitely often. In an earlier paper...
EJC
2011
12 years 11 months ago
2011
We present an algorithm which takes a graph as input and decides in cubic time if the graph is the cocircuit graph of a uniform oriented matroid. In the affirmative case the algor...
EJC
2011
12 years 8 months ago
2011
Answering a question of B´ona, it is shown that for n ≥ 2 the probability that 1 and 2 are in the same cycle of a product of two n-cycles on the set {1, 2, . . . , n} is 1/2 if...