P. Erdos. Extremal problems in graph theory. In Theory of Graphs and its Applications (Proc. Sympos. Smolenice, 1963), pages 29--36. Publ. House Czechoslovak Acad. Sci., Prague, 1964. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
A Simple Linear Time Algorithm for Computing Sparse Spanners.. - Baswana, Sen (Correct)
....t 2 if and only if it does not have a t spanner other than the graph itself. A classical result from graph theory shows that every graph with n edges must have a cycle of length at most 2k. Alon et al. 1] show that even edges are in fact enough. It has been conjectured by Erdos [9], Bondy and Simonovits [7] and Bollobas [6] that this bound is indeed tight. Namely, for any k 1, there are graphs with ) edges that have girth greater than 2k. However, the proof exists only for the cases k = 1; 2; 3 and 5. Since any graph has a bipartite sub graph with at least half the ....
P. Erdos. Extremal problems in graph theory. In Theory of Graphs and its Applications(Proc. Sympos. Smolenice,1963.
Maximum Sum Of Bandwidths Of Complementary Graphs - Füredi, West (1998) (Correct)
.... 2 Gamma1=k ) This was proved for K 2;2 in Erdos R enyi S os [5] and (simultaneously and independently) in Brown [2] For K 3;3 it appears in Brown [2] For K k;l with k l , results appear in Koll ar R onyai Szab o [15] later improved for k (l Gamma 1) in Alon R onyai Szab o [1] Erdos [6] also proved that when r l 1, there exists a constant c r;l such that ex(n; H 0 (r; l) c r;l n 2 Gamma1= r Gammal) His proof is somewhat complicated and does not give a sufficiently good constant in the range where we need (when both r and l are about log 2 n) Another upper bound for ....
P. Erdos, On an extremal problem in graph theory, Colloq. Math. 13 (1965), 251--254. Also see [8], 182--185.
Approximate Distance Oracles - Thorup, Zwick (2001) (33 citations) (Correct)
No context found.
P. Erdos. Extremal problems in graph theory. In Theory of Graphs and its Applications (Proc. Sympos. Smolenice, 1963), pages 29--36. Publ. House Czechoslovak Acad. Sci., Prague, 1964.
Approximate Distance Oracles - Thorup, Zwick (2001) (33 citations) (Correct)
No context found.
P. Erdos. Extremal problems in graph theory. In Theory of Graphs and its Applications (Proc. Sympos. Smolenice, 1963.
Compact Routing Schemes - Thorup, Zwick (2001) (37 citations) (Correct)
No context found.
P. Erdos. Extremal problems in graph theory. In Theory of Graphs and its Applications (Proc. Sympos. Smolenice, 1963.
Approximate Distance Oracles - Mikkel Thorup Uri (2001) (33 citations) (Correct)
No context found.
P. Erdos. Extremal problems in graph theory. In Theory of Graphs and its Applications (Proc. Sympos. Smolenice, 1963), pages 29--36. Publ. House Czechoslovak Acad. Sci., Prague, 1964.
Graph Minor Hierarchies - Diestel, Kühn (2002) (Correct)
No context found.
P. Erdos, Extremal problems in graph theory, in (M. Fiedler, ed.) Theory of graphs and its applications, Proc. Symp. Smolenice
Semicomplete Multipartite Digraphs - Yeo (1998) (Correct)
No context found.
P. Erdos and E. Howorka, An extremal problem in graph theory, Ars Combinatoria 9 (1980) 249 - 251.
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