1215 search results - page 116 / 243 » Combinatorics |
106
Voted
COMBINATORICS
2006
15 years 3 months ago
2006
A graph is Y Y reducible if it can be reduced to isolated vertices by a sequence of series-parallel reductions and Y Y transformations. It is still an open problem to characterize...
115
click to vote
COMBINATORICS
2006
15 years 3 months ago
2006
We present a variation of James Propp's generalized domino shuffling, which provides an efficient way to obtain perfect matchings of weighted Aztec diamonds. Our modification...
115
Voted
COMBINATORICS
2006
15 years 3 months ago
2006
Let G be a graph. A vertex labeling of G is distinguishing if the only label-preserving automorphism of G is the identity map. The distinguishing number of G, D(G), is the minimum...
118
Voted
COMBINATORICS
2006
15 years 3 months ago
2006
We prove that n+h 4 vertex guards are always sufficient to see the entire interior of an n-vertex orthogonal polygon P with an arbitrary number h of holes provided that there exis...
110
click to vote
COMBINATORICS
2006
15 years 3 months ago
2006
We give a new derivation of the threshold of appearance of the k-core of a random graph. Our method uses a hybrid model obtained from a simple model of random graphs based on rand...