Sciweavers

JCT
2010
79views more  JCT 2010»
13 years 8 days ago
Confinement of matroid representations to subsets of partial fields
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 ...
Rudi Pendavingh, Stefan H. M. van Zwam
JCT
2010
127views more  JCT 2010»
13 years 8 days ago
On the density of a graph and its blowup
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 ...
Asaf Shapira, Raphael Yuster
JCT
2010
74views more  JCT 2010»
13 years 8 days ago
Claw-free graphs VI. Colouring
Maria Chudnovsky, Paul D. Seymour
JCT
2010
67views more  JCT 2010»
13 years 8 days ago
On finite edge-primitive and edge-quasiprimitive graphs
Many famous graphs are edge-primitive, for example, the Heawood graph, the Tutte
Michael Giudici, Cai Heng Li
JCT
2010
66views more  JCT 2010»
13 years 8 days ago
On fixed point sets of distinguished collections for groups of parabolic characteristic
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...
John Maginnis, Silvia Onofrei
JCT
2010
98views more  JCT 2010»
13 years 8 days ago
Lifts of matroid representations over partial fields
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...
Rudi Pendavingh, Stefan H. M. van Zwam
JCT
2010
85views more  JCT 2010»
13 years 8 days ago
Symmetric bilinear forms over finite fields of even characteristic
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...
Kai-Uwe Schmidt
JCT
2010
113views more  JCT 2010»
13 years 3 months ago
Equations resolving a conjecture of Rado on partition regularity
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...
Boris Alexeev, Jacob Tsimerman
JCT
2010
92views more  JCT 2010»
13 years 3 months ago
Enumeration by kernel positions for strongly Bernoulli type truncation games on words
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...
Gábor Hetyei