Download:
|
by Vojtech R Odl, Andrzej Ruci Nski, Michelle Wagner, Of G
http://www.mathcs.emory.edu/~rodl/papers/2001/rrw01.ps.gz
Add To MetaCart
Abstract:
Abstract. A bipartite graph G = (U, V; E) is called #-regular if the edge density of every su#ciently large induced subgraph di#ers from the edge density of G by no more than #. If, in addition, the degree of each vertex in G is between (d
Citations
|
1301
|
The Probabilistic Method
– Alon, Spencer
- 1992
|
|
364
|
An n 5=2 Algorithm for Maximum Matching in Bipartite Graphs
– Hopcroft, Karp
- 1973
|
|
358
|
Random Graphs
– Janson, ̷Luczak, et al.
- 2000
|
|
65
|
On a combinatorial game
– Erdős, Selfridge
- 1981
|
|
61
|
The algorithmic aspects of the Regularity Lemma
– Alon, Duke, et al.
- 1994
|
|
22
|
Proof of a conjecture of P. Erdős
– Hajnal, Szemerédi
- 1969
|
|
17
|
Edge disjoint placement of graphs
– Sauer, Spencer
- 1978
|
|
2
|
ark ozy
– os, S
- 1997
|
|
1
|
Ruci nski, Perfect matchings in #-regular graphs
– Alon, odl, et al.
- 1998
|
|
1
|
ark ozy, and E. Szemer edi, An algorithmic version of the blow-up lemma, Random Structures Algorithms
– os, S
- 1998
|
|
1
|
ark ozy, and E. Szemer edi, On the Posa-Seymour conjecture
– os, S
- 1998
|
|
1
|
ark ozy, and E. Szemer edi, Proof of the Seymour conjecture for large graphs
– os, S
- 1998
|
|
1
|
odl and A. Ruci nski, Perfect matchings in #-regular graphs and the blow-up lemma
– R
- 1999
|
|
1
|
An algorithmic embedding of graphs via
– odl, nski, et al.
- 1998
|
|
1
|
edi, Partitions of graphs, in Problemes Combinatoires et theorie des graphes
– Szemer
- 1978
|
|
1
|
The Derandomization of the Blow-up Lemma
– Wagner
- 1999
|
