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
ZerehCache: ArmoringCacheArchitecturesinHighDefect DensityTechnologies
Amin Ansari,Shantanu Gupta,Shuguang Feng,Scott Mahlke +3 more
- 01 Jan 2009
TL;DR: This work re-examines the design of process variation tolerant onchip caches with the focus on flexibility and dynamic reconfigurability to allow a large number defects to be tolerated with modest hardware overhead.
On the Chromatic Number of Non-Sparse Random Intersection Graphs
TL;DR: The computational problem of properly coloring random instances of the binomial random intersection graphs model, for which RIGs differ substantially from Erdős-Rényi random graphs and for which greedy approaches fail is focused on.
•Posted Content
Index Coding Increases Capacity of Information-Centric Networks.
Mohsen Karimzadeh Kiskani,Hamid R. Sadjadpour +1 more
- 07 Dec 2014
TL;DR: The index coding problem is extended to cases when the source node can reach users through multi-hop communications and a new approach is called Modified Index Coding (MIC) which can be applied to both wireless and wired networks.
Orders of Induced Subgraphs in Sparse Random Graphs
TL;DR: In this paper, the authors focus on the probability distribution for the orders of induced subgraphs of a given type in a random graph, where the edge probability p depends on n and p ( n ) 0 as n m.
Throughput and Delay Optimization of Linear Network Coding in Wireless Broadcast
Mingchao Yu
- 01 Jan 2016
TL;DR: This thesis presents a comprehensive study on the joint optimization of throughput and average packet decoding delay (APDD) for LNC in wireless broadcast and reveals the fundamental performance limits of LNC.
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