Quirk and Seymour have shown that a connected simple graph has at least as many spanning trees as circuits. This paper extends and strengthens their result by showing that in a simple binary matroid M the quotient of the number of bases by the number of circuits is at least 2. Moreover, if M has no coloops and rank r, this quotient exceeds 6(r + 1)/19
AbstractA cycle of a matroid is a disjoint union of circuits. A cycle C of a matroid M is spanning i...
We consider different ways of describing a matroid to a Turing machine by listing the members of var...
Let b(M) and c(M), respectively, be the number of bases and circuits of a matroid M. For any given m...
Quirk and Seymour have shown that a connected simple graph has at least as many spanning trees as ci...
Let t(G) be the number of spanning trees of a connected graph G, and let b(G) be the number of bases...
AbstractLet G be a 2-connected undirected graph with n vertices. Its connected subgraphs of n−1 edge...
AMS Subject Classication: 05B35, 05A16 Abstract. Let t(G) be the number of spanning trees of a conne...
Bondy proved that an n-vertex simple Hamiltonian graph with at least n 2 /4 edges has cycles of ever...
AbstractWe give several results about the asymptotic behaviour of matroids. Specifically, almost all...
AbstractBondy proved that an n-vertex simple Hamiltonian graph with at least n2/4 edges has cycles o...
AbstractIn [On Mills's conjecture on matroids with many common bases, Discrete Math. 240 (2001) 271–...
We study the circuit lattice of a binary matroid, i.e. the set of all integer linear combinations of...
Abstract. Bondy proved that an n-vertex simple Hamiltonian graph with at least n 2 /4 edges has cycl...
AbstractLemos (Discrete Math. 240 (2001) 271–276) proved a conjecture of Mills (Discrete Math. 203 (...
International audienceLas Vergnas & Hamidoune studied the number of circuits needed to determine an ...
AbstractA cycle of a matroid is a disjoint union of circuits. A cycle C of a matroid M is spanning i...
We consider different ways of describing a matroid to a Turing machine by listing the members of var...
Let b(M) and c(M), respectively, be the number of bases and circuits of a matroid M. For any given m...
Quirk and Seymour have shown that a connected simple graph has at least as many spanning trees as ci...
Let t(G) be the number of spanning trees of a connected graph G, and let b(G) be the number of bases...
AbstractLet G be a 2-connected undirected graph with n vertices. Its connected subgraphs of n−1 edge...
AMS Subject Classication: 05B35, 05A16 Abstract. Let t(G) be the number of spanning trees of a conne...
Bondy proved that an n-vertex simple Hamiltonian graph with at least n 2 /4 edges has cycles of ever...
AbstractWe give several results about the asymptotic behaviour of matroids. Specifically, almost all...
AbstractBondy proved that an n-vertex simple Hamiltonian graph with at least n2/4 edges has cycles o...
AbstractIn [On Mills's conjecture on matroids with many common bases, Discrete Math. 240 (2001) 271–...
We study the circuit lattice of a binary matroid, i.e. the set of all integer linear combinations of...
Abstract. Bondy proved that an n-vertex simple Hamiltonian graph with at least n 2 /4 edges has cycl...
AbstractLemos (Discrete Math. 240 (2001) 271–276) proved a conjecture of Mills (Discrete Math. 203 (...
International audienceLas Vergnas & Hamidoune studied the number of circuits needed to determine an ...
AbstractA cycle of a matroid is a disjoint union of circuits. A cycle C of a matroid M is spanning i...
We consider different ways of describing a matroid to a Turing machine by listing the members of var...
Let b(M) and c(M), respectively, be the number of bases and circuits of a matroid M. For any given m...
DOI
Add to ORKG