The longest path in a random graph-Reference-Cited by-同舟云学术

The longest path in a random graph

Published:1981-03 Issue:1 Volume:1 Page:1-12
ISSN:0209-9683
Container-title:Combinatorica
language:en
Short-container-title:Combinatorica

Author:

Ajtai Miklós,Komlós János,Szemerédi Endre

Publisher

Springer Science and Business Media LLC

Subject

Computational Mathematics,Discrete Mathematics and Combinatorics

Link

http://link.springer.com/content/pdf/10.1007/BF02579172.pdf

Reference4 articles.

1. P. Erdős andA. Rényi, On the evolution of random graphs,Publications of the Math. Inst. the Hung. Acad. of Sci.,5 (1960), 17–61.

2. A. Rényi, Some remarks on the theory of trees,Publications of the Math. Inst. of the Hung. Acad. of Sci.,4 (1959), 73–85.

3. W. F. de la Vega, Sur la plus grande longueur des chemins élémentaires de graphes aléatoires,Preprint of Laboratoire d’informatique pour les Sciences de l’Homme, C.N.R.S., 1979.

4. P. Erdős, Problems and results on finite and infinite graphs, inProc. Symp. Prague 1974, Akademia Praha 1975.

Cited by 86 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Isoperimetric Inequalities and Supercritical Percolation on High-Dimensional Graphs;Combinatorica;2024-04-04

2. Long paths in heterogeneous random subgraphs of graphs with large minimum degree;Information Processing Letters;2023-08

3. Heavy and light paths and Hamilton cycles;Information Processing Letters;2023-08

4. A Note on Long Cycles in Sparse Random Graphs;The Electronic Journal of Combinatorics;2023-05-05

5. Turán‐type problems for long cycles in random and pseudo‐random graphs;Journal of the London Mathematical Society;2023-02-26