5 search results - page 1 / 1 » G-Intersection Theorems for Matchings and Other Graphs |
CPC
2008
13 years 4 months ago
2008
If G is a graph with vertex set [n] then A 2[n] is G-intersecting if for all A, B A either A B = or there exist a A and b B such that a G b. The question of how large a k-un...
EJC
2000
13 years 4 months ago
2000
We study the zeros of two families of polynomials related to rook theory and matchings in graphs. One of these families is based on the cover polynomial of a digraph introduced by ...
COMBINATORICS
2000
13 years 4 months ago
2000
In this article, Temperley's bijection between spanning trees of the square grid on the one hand, and perfect matchings (also known as dimer coverings) of the square grid on ...
STOC
2006
ACM
13 years 10 months ago
2006
ACM
It has been known for some time that graph isomorphism reduces to the hidden subgroup problem (HSP). What is more, most exponential speedups in quantum computation are obtained by...
BIRTHDAY
2010
Springer
13 years 5 months ago
2010
Springer
Many natural problems in computer science concern structures like graphs where elements are not inherently ordered. In contrast, Turing machines and other common models of computa...