Add to ORKGBondy 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)
We prove that a binary matroid with huge branch-width contains the cycle matroid of a large grid as ...
We prove that a binary matroid with huge branch-width contains the cycle matroid of a large grid as ...
We prove that a binary matroid with huge branch-width contains the cycle matroid of a large grid as ...
Abstract. Bondy proved that an n-vertex simple Hamiltonian graph with at least n 2 /4 edges has cycl...
AbstractBondy proved that an n-vertex simple Hamiltonian graph with at least n2/4 edges has cycles o...
Bondy proved that an n-vertex simple Hamiltonian graph with at least n2/4 edges has cycles of every ...
AbstractBondy proved that an n-vertex simple Hamiltonian graph with at least n2/4 edges has cycles o...
Quirk and Seymour have shown that a connected simple graph has at least as many spanning trees as ci...
AbstractIn the circuit graph of a matroid the vertices are the circuits and the edges are the pairs ...
AbstractLetF7denote the Fano matroid andMbe a simple connected binary matroid such that every cocirc...
We prove that a binary matroid with huge branch-width contains the cycle matroid of a large grid as ...
We prove that a binary matroid with huge branch-width contains the cycle matroid of a large grid as ...
We prove that a binary matroid with huge branch-width contains the cycle matroid of a large grid as ...
AbstractWe prove that a binary matroid with huge branch-width contains the cycle matroid of a large ...
AbstractAs is well known, the cycles of any given graph G may be regarded as the circuits of a matro...
We prove that a binary matroid with huge branch-width contains the cycle matroid of a large grid as ...
We prove that a binary matroid with huge branch-width contains the cycle matroid of a large grid as ...
We prove that a binary matroid with huge branch-width contains the cycle matroid of a large grid as ...
Abstract. Bondy proved that an n-vertex simple Hamiltonian graph with at least n 2 /4 edges has cycl...
AbstractBondy proved that an n-vertex simple Hamiltonian graph with at least n2/4 edges has cycles o...
Bondy proved that an n-vertex simple Hamiltonian graph with at least n2/4 edges has cycles of every ...
AbstractBondy proved that an n-vertex simple Hamiltonian graph with at least n2/4 edges has cycles o...
Quirk and Seymour have shown that a connected simple graph has at least as many spanning trees as ci...
AbstractIn the circuit graph of a matroid the vertices are the circuits and the edges are the pairs ...
AbstractLetF7denote the Fano matroid andMbe a simple connected binary matroid such that every cocirc...
We prove that a binary matroid with huge branch-width contains the cycle matroid of a large grid as ...
We prove that a binary matroid with huge branch-width contains the cycle matroid of a large grid as ...
We prove that a binary matroid with huge branch-width contains the cycle matroid of a large grid as ...
AbstractWe prove that a binary matroid with huge branch-width contains the cycle matroid of a large ...
AbstractAs is well known, the cycles of any given graph G may be regarded as the circuits of a matro...
We prove that a binary matroid with huge branch-width contains the cycle matroid of a large grid as ...
We prove that a binary matroid with huge branch-width contains the cycle matroid of a large grid as ...
We prove that a binary matroid with huge branch-width contains the cycle matroid of a large grid as ...