On the public citation graph

The concentration of the chromatic number of random graphs

https://doi.org/10.1007/bf01215914
0 signed · 93 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bf01192522openalex-snapshot
Covering the edges of a random graph by cliques
inferredcites →https://doi.org/10.1007/bf01205080openalex-snapshot
A note on the sharp concentration of the chromatic number of random graphs
inferredcites →https://doi.org/10.1007/bf01215921openalex-snapshot
On the minimal number of edges in color-critical graphs
inferredcites →https://doi.org/10.1007/bf01375472openalex-snapshot
The chromatic number of random graphs
inferredcites →https://doi.org/10.1007/bf02122551openalex-snapshot
The chromatic number of random graphs
inferredcites →https://doi.org/10.1007/bf02579208openalex-snapshot
Sharp concentration of the chromatic number on random graphsG n, p
inferredcites →https://doi.org/10.1017/cbo9780511662089.002openalex-snapshot
Restricted colorings of graphs
inferredcites →https://doi.org/10.1017/cbo9780511662133openalex-snapshot
Surveys in Combinatorics
inferredcites →https://doi.org/10.5860/choice.32-6283openalex-snapshot
Graph coloring problems

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.2139/ssrn.4778361openalex-extracted
Rejali's Conjecture on Limiting Distribution of the Chromatic Number of a Random Graph
inferred← citeshttps://doi.org/10.1002/(sici)1098-2418(199807)12:4<381::aid-rsa5>3.0.co;2-popenalex-snapshot
The chromatic numbers of random hypergraphs
inferred← citeshttps://doi.org/10.1002/(sici)1098-2418(1999010)14:1<63::aid-rsa3>3.0.co;2-7openalex-snapshot
A Sharp Threshold fork-Colorability
inferred← citeshttps://doi.org/10.1002/9780470400531.eorms0146openalex-snapshot
Maximum Clique, Maximum Independent Set, and Graph Coloring Problems
inferred← citeshttps://doi.org/10.1002/9781118032718.refsopenalex-snapshot
References
inferred← citeshttps://doi.org/10.1002/rsa.20445openalex-snapshot
Coloring random graphs online without creating monochromatic subgraphs
inferred← citeshttps://doi.org/10.1002/rsa.20757openalex-snapshot
The chromatic number of dense random graphs
inferred← citeshttps://doi.org/10.1002/rsa.20824openalex-snapshot
Hypergraph coloring up to condensation
inferred← citeshttps://doi.org/10.1002/rsa.20953openalex-snapshot
Short proofs of some extremal results III
inferred← citeshttps://doi.org/10.1002/rsa.70014openalex-snapshot
The Clique Chromatic Number of Sparse Random Graphs
inferred← citeshttps://doi.org/10.1007/978-1-4614-8033-4_43openalex-snapshot
Scan Statistics on Graphs and Networks
inferred← citeshttps://doi.org/10.1007/978-1-4614-8414-1_43-1openalex-snapshot
Scan Statistics on Graphs and Networks
inferred← citeshttps://doi.org/10.1007/978-3-030-80627-9_2openalex-snapshot
Combinatorics
inferred← citeshttps://doi.org/10.1007/978-3-0348-8211-8_11openalex-snapshot
Coloring Random Graphs — an Algorithmic Perspective
inferred← citeshttps://doi.org/10.1007/978-3-540-45198-3_20openalex-snapshot
The Lovász Number of Random Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-73420-8_67openalex-snapshot
On the Chromatic Number of Random Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-03351-3_11openalex-snapshot
Approximability Distance in the Space of H-Colourability Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-39286-3_3openalex-snapshot
The Phase Transition in the Erdős-Rényi Random Graph Process
inferred← citeshttps://doi.org/10.1007/s00373-014-1405-5openalex-snapshot
Sharp Concentration of Hitting Size for Random Set Systems
inferred← citeshttps://doi.org/10.1007/s00493-008-2283-3openalex-snapshot
Two-point concentration in random geometric graphs
inferred← citeshttps://doi.org/10.1007/s00493-016-3394-xopenalex-snapshot
Local Convergence of Random Graph Colorings
inferred← citeshttps://doi.org/10.1007/s00493-021-4236-zopenalex-snapshot
Lower Bounds on the Chromatic Number of Random Graphs
inferred← citeshttps://doi.org/10.1007/s004939970001openalex-snapshot
List Coloring of Random and Pseudo-Random Graphs
inferred← citeshttps://doi.org/10.1007/s13171-020-00205-4openalex-snapshot
Cliques and Chromatic Number in Multiregime Random Graphs
inferred← citeshttps://doi.org/10.1016/j.aim.2009.08.006openalex-snapshot
On the chromatic number of random d-regular graphs
inferred← citeshttps://doi.org/10.1016/j.aim.2017.08.031openalex-snapshot
Resilience for the Littlewood–Offord problem
inferred← citeshttps://doi.org/10.1016/j.aim.2018.05.029openalex-snapshot
Information-theoretic thresholds from the cavity method
inferred← citeshttps://doi.org/10.1016/j.disc.2008.09.019openalex-snapshot
A note on the chromatic number of a dense random graph
inferred← citeshttps://doi.org/10.1016/j.disc.2008.12.014openalex-snapshot
Random regular graphs of non-constant degree: Concentration of the chromatic number
inferred← citeshttps://doi.org/10.1016/j.disc.2025.114962openalex-snapshot
The fractional chromatic number of random graphs
inferred← citeshttps://doi.org/10.1016/j.endm.2017.06.025openalex-snapshot
Resilience for the Littlewood-Offord Problem
inferred← citeshttps://doi.org/10.1016/j.jcss.2013.06.003openalex-snapshot
Average-case complexity of backtrack search for coloring sparse random graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2007.11.009openalex-snapshot
On the chromatic number of random graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2015.09.006openalex-snapshot
On the chromatic number of random regular graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2016.03.005openalex-snapshot
Short proofs of some extremal results II
inferred← citeshttps://doi.org/10.1016/j.tcs.2023.113771openalex-snapshot
Concentration of rainbow k-connectivity of a multiplex random graph
inferred← citeshttps://doi.org/10.1017/cbo9781139519793.013openalex-snapshot
Colouring random graphs
inferred← citeshttps://doi.org/10.1017/fms.2024.6openalex-snapshot
Two-Point Concentration of the Independence Number of the Random Graph
inferred← citeshttps://doi.org/10.1017/s0963548303006060openalex-snapshot
How Sharp is the Concentration of the Chromatic Number?
inferred← citeshttps://doi.org/10.1017/s0963548307008607openalex-snapshot
On the Strong Chromatic Number of Random Graphs
inferred← citeshttps://doi.org/10.1017/s0963548316000390openalex-snapshot
Planting Colourings Silently
inferred← citeshttps://doi.org/10.1017/s0963548318000251openalex-snapshot
On the Number of Solutions in Random Graphk-Colouring
inferred← citeshttps://doi.org/10.1017/s0963548319000397openalex-snapshot
Sharp concentration of the equitable chromatic number of dense random graphs
inferred← citeshttps://doi.org/10.1017/s0963548399004095openalex-snapshot
On the Choice Number of Random Hypergraphs
inferred← citeshttps://doi.org/10.1090/jams/957openalex-snapshot
Non-concentration of the chromatic number of a random graph
inferred← citeshttps://doi.org/10.1093/imrn/rnv333openalex-snapshot
The Chromatic Number of Random Graphs for Most Average Degrees
inferred← citeshttps://doi.org/10.1109/focs.2013.48openalex-snapshot
Chasing the K-Colorability Threshold
inferred← citeshttps://doi.org/10.1109/synasc.2010.61openalex-snapshot
Improved Bounds on the Complexity of Graph Coloring
inferred← citeshttps://doi.org/10.1109/tit.2017.2695611openalex-snapshot
Order-Optimal Rate of Caching and Coded Multicasting With Random Demands
inferred← citeshttps://doi.org/10.1109/tit.2021.3127126openalex-snapshot
Bounds for List-Decoding and List-Recovery of Random Linear Codes
inferred← citeshttps://doi.org/10.1112/jlms.12794openalex-snapshot
How does the chromatic number of a random graph vary?
inferred← citeshttps://doi.org/10.1134/s1064562420050312openalex-snapshot
On the Chromatic Numbers of Random Hypergraphs
inferred← citeshttps://doi.org/10.1134/s1064562423700424openalex-snapshot
On the Concentration of Values of j-Chromatic Numbers of Random Hypergraphs
inferred← citeshttps://doi.org/10.1137/1.9781611973082.13openalex-snapshot
Coloring random graphs online without creating monochromatic subgraphs
inferred← citeshttps://doi.org/10.1137/12090054xopenalex-snapshot
On the Concentration of the Domination Number of the Random Graph
inferred← citeshttps://doi.org/10.1137/16m1062107openalex-snapshot
One-Point Concentration of the Clique and Chromatic Numbers of the Random Cayley Graph on $\mathbb{F}_2^n$
inferred← citeshttps://doi.org/10.1137/s0040585x97t990861openalex-snapshot
On Two Limit Values of the Chromatic Number of a Random Hypergraph
inferred← citeshttps://doi.org/10.1145/1007352.1007442openalex-snapshot
The two possible values of the chromatic number of a random graph
inferred← citeshttps://doi.org/10.1145/3055399.3055420openalex-snapshot
Information-theoretic thresholds from the cavity method
inferred← citeshttps://doi.org/10.1145/3183350openalex-snapshot
Complexity of Coloring Random Graphs
inferred← citeshttps://doi.org/10.1155/2014/749856openalex-snapshot
A Note on the Warmth of Random Graphs with Given Expected Degrees
inferred← citeshttps://doi.org/10.31857/s2686954322600756openalex-snapshot
ON THE CONCENTRATION OF VALUES OF j-CHROMATIC NUMBERS OF RANDOM HYPERGRAPHS
inferred← citeshttps://doi.org/10.3390/e26090764openalex-snapshot
Quantum State Combinatorics
inferred← citeshttps://doi.org/10.37236/10728openalex-snapshot
On the Chromatic Number in the Stochastic Block Model
inferred← citeshttps://doi.org/10.37236/11638openalex-snapshot
On the Concentration of the Chromatic Number of Random Graphs
inferred← citeshttps://doi.org/10.37236/1643openalex-snapshot
Sparse Graphs Usually Have Exponentially Many Optimal Colorings
inferred← citeshttps://doi.org/10.3929/ethz-a-007230480openalex-snapshot
Ramsey games in random graphs
inferred← citeshttps://doi.org/10.4007/annals.2005.162.1335openalex-snapshot
The two possible values of the chromatic number of a random graph
inferred← citeshttps://doi.org/10.4213/tvp5458openalex-snapshot
О двух предельных значениях хроматического числа случайного гиперграфа
inferred← citeshttps://doi.org/10.46298/dmtcs.3517openalex-snapshot
Concentration Properties of Extremal Parameters in Random Discrete Structures
inferred← citeshttps://doi.org/10.48550/arxiv.0706.1725openalex-snapshot
The two possible values of the chromatic number of a random graph
inferred← citeshttps://doi.org/10.48550/arxiv.0806.0178openalex-snapshot
On the concentration of the chromatic number of random graphs
inferred← citeshttps://doi.org/10.48550/arxiv.0809.2477openalex-snapshot
Two new Probability inequalities and Concentration Results
inferred← citeshttps://doi.org/10.48550/arxiv.0911.0600openalex-snapshot
Concentration of the adjacency matrix and of the Laplacian in random graphs with independent edges
inferred← citeshttps://doi.org/10.48550/arxiv.1009.0792openalex-snapshot
Warmth and mobility of random graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1201.5097openalex-snapshot
Sharp Concentration of Hitting Size for Random Set Systems
inferred← citeshttps://doi.org/10.48550/arxiv.1209.3115openalex-snapshot
On the Concentration of the Domination Number of the Random Graph
inferred← citeshttps://doi.org/10.48550/arxiv.1404.7348openalex-snapshot
Topics in Ramsey Theory
inferred← citeshttps://doi.org/10.48550/arxiv.1510.05991openalex-snapshot
One-point concentration of the clique and chromatic numbers of the random Cayley graph on F_2^n
inferred← citeshttps://doi.org/10.48550/arxiv.1609.08136openalex-snapshot
Resilience for the Littlewood-Offord Problem
inferred← citeshttps://doi.org/10.48550/arxiv.2012.02050openalex-snapshot
A General Dependency Structure for Random Graphs and Its Effect on Monotone Properties
inferred← citeshttps://doi.org/10.48550/arxiv.2109.07773openalex-snapshot
On the chromatic number of graphons
inferred← citeshttps://doi.org/10.5287/ora-prvzaepnyopenalex-snapshot
Colourings of random graphs
inferred← citeshttps://doi.org/10.7151/dmgt.1758openalex-snapshot
Induced acyclic tournaments in random digraphs: Sharp concentration, thresholds and algorithms
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.