3267 search results - page 2 / 654 » Generalized quasirandom graphs |
SIAMDM
2008
13 years 5 months ago
2008
In this paper we consider the problem of testing whether a graph is triangle-free, and more generally, whether it is H-free, for a fixed subgraph H. The algorithm should accept gr...
SODA
2008
ACM
13 years 6 months ago
2008
ACM
One of the main questions that arise when studying random and quasi-random structures is which properties P are such that any object that satisfies P "behaves" like a tr...
COMBINATORICA
2008
13 years 5 months ago
2008
We show that if a graph G has the property that all subsets of vertices of size n/4 contain the "correct" number of triangles one would expect to find in a random graph ...
RSA
2008
13 years 4 months ago
2008
It is now known that many properties of the objects in certain combinatorial structures are equivalent, in the sense that any object possessing any of the properties must of neces...
ENDM
2006
13 years 5 months ago
2006
Jim Propp's rotor router model is a simple deterministic analogue of a random walk. Instead of distributing chips randomly, it serves the neighbors in a fixed order. We analy...