Open Access
Chromatic number of random graphs
Béla Bollobás
- 01 Jan 1988
322
TL;DR: It is shown that for a fixed probabilityp, 0<p<1, almost every random graphGn,p has chromatic number log (1/(1 - p) + o(1) + 1 + o (1)log n, where n is the number of random graphs.
read more
Abstract: One of the best known and most studied unsol;eed problems in the theory of random graphs is the determination of the chromatic number of almost every random graph. As usual, we write Gp for a random graph with vertex set V= In] = {1, 2 . . . . . n} in which the edges are chosen independently and with probability p=p(n), 0 < p < 1. In most of what follows, we shall take p to be fixed and write d = 1/(1-p). Putting it rather crudely, Grimmett and McDiarmid [8] proved that a. e. Gp is such that its chromatic number X(Gp) satisfies
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
Coded Caching in Wireless Networks and Storage Systems
Mohsen Karimzadeh Kiskani
- 01 Jan 2017
TL;DR: It is shown that using coded caching based on RLF codes the authors can achieve asymptotic perfect secrecy and it is proved that perfect privacy and secrecy is achievable in these systems.
An α-cut chromatic number of a total uncertain graph and its properties
Isnaini Rosyida,Widodo,Ch. Rini Indrati,Kiki A. Sugeng +3 more
- 11 Feb 2016
TL;DR: In this article, the authors introduced the concept of an α-cut of a total uncertain graph and investigated some of its properties, including the properties of the α cut chromatic number for all α ∈ [0, 1].
1
Colorings of spaces, and random graphs
TL;DR: In this article, the authors deal with some problems on the embeddings of finite geometric graphs into the random ones, and apply the random graph theory to the Nelson-Erdos-Hadwiger problem on coloring spaces.
1
Quo Vadis, Random Graph Theory?
TL;DR: In this paper, the authors trace the growth of the random graph theory from its inception with Erdős and Renyi in 1959-60 to the present, covering a thirty year period that has just seen the appearance of the first issue of a journal devoted to this subject, namely the Journal of Random Structures & Algorithms.
1
A time-slot and channel assignment algorithm in OFDM/TDMA wireless mesh networks
Vida Ferdowsi,K. Mitchell +1 more
- 12 Apr 2012
TL;DR: A scheduling algorithm that assigns both time slots and channels to wireless transmission links in a conflict free manner is introduced and an algorithm that finds the maximum independent set of the graphs is proposed for the purpose of maximizing the total throughput of the network.
1
References
•Book
Asymptotic theory of finite dimensional normed spaces
Vitali Milman,Gideon Schechtman +1 more
- 01 Jan 1986
TL;DR: The concentration of measure phenomenons in the theory of Normed spaces was discussed in this paper, where the Rademacher projection was applied to the case of finite Dimensional Normed Spaces.
1.2K
On Tail Probabilities for Martingales
TL;DR: In this paper, the Laplace transform of the crossing time of a martingale with uniformly bounded increments is shown to have the same distribution as the distribution of crossing times of Brownian motion, even in the tail.
On colouring random graphs
Geoffrey Grimmett,Colin McDiarmid +1 more
- 01 Mar 1975
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.
406
Cliques in random graphs
Béla Bollobás,Paul Erdös +1 more
- 01 Nov 1976
TL;DR: In this paper, the maximal size of a clique and the number of Kr's in a complete graph with n points and m edges is investigated. But the maximal clique is not a maximal complete subgraph.
398