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
Better logic obeying a zero-one law
Simi HaberSaharon Shelah
- 01 Jan 2012
TL;DR: In this article, it was shown that there is a regular language able to express connectivity and k-colorability for any constant k and still obey the zero-one law, and that in any (semiregular) language strong enough to express Hamiltonicity one can interpret arithmetic and thus the zeroone law fails miserably.
1
•Posted Content
Complete Acyclic Colorings.
TL;DR: Two parameters that arise from the dichromatic number and the vertex-arboricity, the largest number of colors its vertices can be colored with such that every color induces an acyclic subdigraph, are studied.
1
A political–economic explanation of “internet space”
Yan Ma,Cai Minqiang,Li Yun +2 more
- 31 Jul 2020
TL;DR: In this article, the authors define the Internet as a virtual space supported by technologies and present in the form of socioeconomic relations from the perspective of political economy, and introduce Internet space as an economic variable into the framework of economic theory.
1
•Posted Content
Random graphs and Lindstrom quantifiers for natural graph properties
Simi Haber,Saharon Shelah +1 more
TL;DR: In this article, it was shown that there is a regular language able to express connectivity and k-colorability for any constant k and still obey the zero-one law, and that in any (semiregular) language strong enough to express Hamiltonicity one can interpret arithmetic and thus the zeroone law fails miserably.
1
•Dissertation
Overcoming hard-faults in high-performance microprocessors
Scott Mahlke,Amin Ansari +1 more
- 01 Jan 2011
TL;DR: Two flexible cache architectures are presented, ZerehCache and Archipelago, to protect regular SRAM structures against high failure rates and a robust and heterogeneous core coupling execution scheme, Necromancer, is presented to protect the general core area against hard-faults.
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