Corpus ID: 117936185

Graph theory and combinatorics, 1988 : proceedings of the Cambridge Combinatorial Conference in honour of Paul Erdős

@inproceedings{Erds1984GraphTA,
  title={Graph theory and combinatorics, 1988 : proceedings of the Cambridge Combinatorial Conference in honour of Paul Erdős},
  author={P. Erdős and B. Bollob{\'a}s},
  year={1984}
}
  • P. Erdős, B. Bollobás
  • Published 1984
  • Mathematics
  • Preface (B. Bollobas). Paul Erdos at Seventy-Five (B. Bollobas). Packing Smaller Graphs into a Graph (J. Akiyama, F. Nakada, S. Tokunaga). The Star Arboricity of Graphs (I. Algor, N. Alon). Graphs with a Small Number of Distinct Induced Subgraphs (N. Alon, B. Bollobas). Extensions of Networks with Given Diameter (J.-C. Bermond, K. Berrada, J. Bond). Confluence of Some Presentations Associated with Graphs (N. Biggs). Long Cycles in Graphs with No Subgraphs of Minimal Degree 3 (B. Bollobas, G… CONTINUE READING
    28 Citations
    Chapter 9 k-clique Percolation and Clustering
    Hamiltonicity in random directed graphs is born resilient
    • 6
    • PDF
    Excluded-minor characterizations of antimatroids arisen from posets and graph searches
    • M. Nakamura
    • Mathematics, Computer Science
    • Discret. Appl. Math.
    • 2003
    • 9
    • PDF
    The max-flow min-cut property of two-dimensional affine convex geometries
    • 4
    Packing Hamilton Cycles Online
    • 6
    • PDF
    Recent advances in percolation theory and its applications
    • 184
    • PDF
    On 4-connected Claw-free Well-covered Graphs
    • 14
    Dynamic Phenomena on Complex Networks
    • 2
    • PDF
    Accurate ranking of influential spreaders in networks based on dynamically asymmetric link weights
    • 14
    • PDF