In [9, p. 469], Oxley made the following conjecture, which is a geometric analogue of a conjecture of Lovasz (see [1, p. 290]) about complete graphs.Conjecture 1.1. Let G be a rank-n GF(q)-representable simple matroid with critical exponent n − γ. If, for every coline X in G, c(G/X; q) = c(G; q) − 2 = n − γ − 2, then G is the projective geometry PG(n − 1, q).We shall call the rank n, the critical ‘co-exponent’ γ, and the order q of the field the parameters of Oxley's conjecture. We exhibit several counterexamples to this conjecture. These examples show that, for a given prime power q and a given positive integer γ, Oxley's conjecture holds for only finitely many ranks n. We shall assume familiarity with matroid theory and, in particular, the theory of critical problems. See [6] and [9].A subset C of points of PG(n − 1, q) is a (γ, k)-cordon if, for every k-codimensional subspace X in PG(n − 1, q), the intersection C ∩ X contains a γ-dimensional subspace of PG(n − 1, q). In this paper, our primary interest will be in constructing (γ, 2)-cordons. With straightforward modifications, our methods will also yield (γ, k)-cordons.Complements of counterexamples to Oxley's conjecture are (γ, 2)-cordons.
[1]
B. Bollobás,et al.
Extremal Graph Theory
,
2013
.
[2]
Jan Mycielski.
Sur le coloriage des graphs
,
1955
.
[3]
Joseph P. S. Kung,et al.
A Geometric Condition for a Hyperplane Arrangement to be Free
,
1998
.
[4]
Joseph E. Bonin.
Modular elements of higher-weight dowling lattices
,
1993,
Discret. Math..
[5]
Geoff Whittle,et al.
A geometric theory of hypergraph colouring
,
1991
.
[6]
Geoff Whittle.
THE CRITICAL PROBLEM FOR POLYMATROIDS
,
1994
.
[7]
Geoff Whittle,et al.
Dowling group geometries and the critical problem
,
1989,
J. Comb. Theory, Ser. B.
[8]
Geoff Whittle.
q-Lifts of Tangential k-Blocks
,
1989
.