Journal Article10.1017/S0305004100051124
On colouring random graphs
Geoffrey Grimmett,Colin McDiarmid +1 more
- 01 Mar 1975
- Vol. 77, Iss: 2, pp 313-324
403
TL;DR: In this paper, it was shown that the number of vertices in the largest complete subgraph of ωn is, with probability one, the same as in this paper.
read more
Abstract: Let ωn denote a random graph with vertex set {1, 2, …, n}, such that each edge is present with a prescribed probability p, independently of the presence or absence of any other edges. We show that the number of vertices in the largest complete subgraph of ωn is, with probability one,
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
TL;DR: This is the second in a series of three papers that empirically examine the competitiveness of simulated annealing in certain well-studied domains of combinatorial optimization.
1K
Introduction to random graphs
Alan Frieze,Michał Karoński +1 more
- 01 Jan 2016
TL;DR: All those interested in discrete mathematics, computer science or applied probability and their applications will find this an ideal introduction to the subject.
Smallest-last ordering and clustering and graph coloring algorithms
David W. Matula,Leland L. Beck +1 more
TL;DR: Smallest-last vertex ordering and prlonty search are utdlzed to show for any graph G = (IT, E) that the set of all connected subgraphs maxunal with respect to their minimum degree can be determined in O(I EI + I VI) time and 21El + O (I VI) space.
595
The chromatic number of random graphs
TL;DR: For a fixed probability p, 0 < p < 1, almost every random graph Gn,p has chromatic number σ 2 + o(1) + σ σ 1/(1 - p)) σ n{log n} as mentioned in this paper.
448
Large Cliques Elude the Metropolis Process
TL;DR: It is shown that the Metropolis process takes super-polynomial time to locate a clique that is only slightly bigger than that produced by the greedy heuristic, which is one step above the greedy one in its level of sophistication.
398
References
•Book
Graph theory
Frank Harary
- 01 Jan 1969
TL;DR: This project focuses on Tutte’s work in cryptography, which enabled the British to read high-level German army messages and has been described as one of the greatest intellectual feats of the war.
18K
Random geometric graphs.
TL;DR: An analytical expression for the cluster coefficient is derived, which shows that the graphs in which each vertex is assigned random coordinates in a geometric space of arbitrary dimensionality are distinctly different from standard random graphs, even for infinite dimensionality.
A Probabilistic Proof of an Asymptotic Formula for the Number of Labelled Regular Graphs
TL;DR: The method determines the asymptotic distribution of the number of short cycles in graphs with a given degree sequence, and gives analogous formulae for hypergraphs.
1.4K
The asymptotic number of labeled graphs with given degree sequences
TL;DR: Asymptotics are obtained for the number of n × n symmetric non-negative integer matrices subject to the following constraints: each row sum is specified and bounded, and a specified “sparse” set of entries must be zero.
1.2K