JCT
2010
13 years 5 months ago
2010
Let M be a matroid representable over a (partial) field and B a matrix representable over a sub-partial field . We say that B confines M to if, whenever a -representation matrix ...
JCT
2010
13 years 5 months ago
2010
It is well-known that, of all graphs with edge-density p, the random graph G(n, p) contains the smallest density of copies of Kt,t, the complete bipartite graph of size 2t. Since ...
JCT
2010
13 years 5 months ago
2010
JCT
2010
13 years 5 months ago
2010
Many famous graphs are edge-primitive, for example, the Heawood graph, the Tutte
JCT
2010
13 years 5 months ago
2010
We determine the nature of the fixed point sets of groups of order p, acting on complexes of distinguished p-subgroups (those p-subgroups containing pcentral elements in their cent...
JCT
2010
13 years 5 months ago
2010
There exist several theorems which state that when a matroid is representable over distinct fields 1,..., k, it is also representable over other fields. We prove a theorem, the Li...
JCT
2010
13 years 5 months ago
2010
Let Sm be the set of symmetric bilinear forms on an m-dimensional vector space over GF(q), where q is a power of two. A subset Y of Sm is called an (m, d)-set if the difference of...
JCT
2010
13 years 9 months ago
2010
A linear equation L is called k-regular if every k-coloring of the positive integers contains a monochromatic solution to L. Richard Rado conjectured that for every positive intege...
JCT
2010
13 years 9 months ago
2010
JCT
2010
13 years 9 months ago
2010
We find the winning strategy for a class of truncation games played on words. As a consequence of the present author’s recent results on some of these games we obtain new formul...