N. Alon, M. Krivelevich and B. Sudakov, Turan Numbers of Bipartite Graphs and Related RamseyType Questions, Combinatorics, Probability and Computing, 12 (2003) 477-494. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Testing Subgraphs in Directed Graphs - Alon, Shapira (2003) (2 citations) Self-citation (Alon) (Correct)
....process should have removed i # from L(#(i # ) We now turn to the proof of Theorem 2, part (ii) The proof is based on a variant of a powerful probabilistic technique, which may be called dependent random choice, and which has already found several recent combinatorial applications. See, e.g. [8] and some of its references. Given a subset of vertices V i V (G) and a vertex v V (G) let N(v, i) denote the set neighbors of v within V i . We need the following lemma. 14 Lemma 5.2 Let G = V, E) be an undirected graph on n vertices, and let V 1 , V 2 , V d 1 be (not ....
N. Alon, M. Krivelevich and B. Sudakov, Turan numbers of bipartite graphs and related Ramseytype questions, submitted.
Zhang Ke Min, see also [BJYHRZ, ChenZZ1, ChenZZ2, ChenZZ3.. - Zhang Shu Sheng (Correct)
No context found.
N. Alon, M. Krivelevich and B. Sudakov, Turan Numbers of Bipartite Graphs and Related RamseyType Questions, Combinatorics, Probability and Computing, 12 (2003) 477-494.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC