Name
Abstract | ||
|---|---|---|
Bondy proved that an n-vertex simple Hamiltonian graph with at least n^2/4 edges has cycles of every length unless it is isomorphic to K\"n\"/\"2\",\"n\"/\"2. This paper considers finding circuits of every size in GF(q)-representable matroids with large numbers of elements. A consequence of the main result is that a rank-r simple binary matroid with at least 2^r^-^1 elements either has circuits of all sizes or is isomorphic to AG(r-1,2). |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1016/j.disc.2005.10.008 | Discrete Mathematics |
Keywords | Field | DocType |
matroid,circuit,pancyclic,gf ( q ) -representable,gf-representable,hamiltonian graph | Matroid,Discrete mathematics,Combinatorics,Hamiltonian path,Vertex (graph theory),Isomorphism,Graphic matroid,Binary matroid,Mathematics | Journal |
Volume | Issue | ISSN |
305 | 1-3 | Discrete Mathematics |
Citations | PageRank | References |
1 | 0.43 | 1 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Brian Beavers | 1 | 4 | 0.97 |
| James Oxley | 2 | 194 | 24.39 |