270 search results - page 6 / 54 » Matching graphs of Hypercubes and Complete Bipartite Graphs |
171
click to vote
GC
2011
Springer
14 years 6 months ago
2011
Springer
The Ramsey number r(H, Kn) is the smallest positive integer N such that every graph of order N contains either a copy of H or an independent set of size n. The Tur´an number ex(m,...
133
click to vote
COMBINATORICS
2002
14 years 11 months ago
2002
Erdos, Rubin, and Taylor found a nice correspondence between the minimum order of a complete bipartite graph that is not r-choosable and the minimum number of edges in an r-unifor...
AMAI
2005
Springer
14 years 11 months ago
2005
Springer
A CNF formula is called matched if its associated bipartite graph (whose vertices are clauses and variables) has a matching that covers all clauses. Matched CNF formulas are satisf...
102
click to vote
ECCC
2010
14 years 6 months ago
2010
Consider a graph obtained by taking an edge disjoint union of k complete bipartite graphs.
DAM
2002
14 years 11 months ago
2002
In K(n, n) with edges colored either red or blue, we show that the problem of finding a solution matching, a perfect matching consisting of exactly r red edges, and (n - r) blue e...