2283 search results - page 107 / 457 » Bounds of Graph Characteristics |
JCT
2007
13 years 8 months ago
2007
Abstract. We develop linear representation theory for bicircular matroids, a chief example being a matroid associated with forests of a graph, and bicircular lift matroids, a chief...
JGT
2010
13 years 6 months ago
2010
The crossing number, cr(G), of a graph G is the least number of crossing points in any drawing of G in the plane. According to the Crossing Lemma of Ajtai, Chv´atal, Newborn, Sze...
ACSC
2005
IEEE
14 years 1 months ago
2005
IEEE
A k-separated matching in a graph is a set of edges at distance at least k from one another (hence, for instance, a 1-separated matching is just a matching in the classical sense)...
JGT
2008
13 years 8 months ago
2008
Let C be a family of n compact connected sets in the plane, whose intersection graph G(C) has no complete bipartite subgraph with k vertices in each of its classes. Then G(C) has ...
JCT
1998
13 years 7 months ago
1998
We show that any k-regular bipartite graph with 2n vertices has at least ((k−1)k−1 kk−2 )n perfect matchings (1-factors). Equivalently, this is a lower bound on the permanent...