On the public citation graph
Sharp concentration of the chromatic number on random graphsG n, p
0 signed · 148 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-3-0348-9078-6_132openalex-snapshot
Probabilistic Methods in Combinatorics
inferredcites →https://doi.org/10.1016/0196-6774(84)90003-8openalex-snapshot
Sequential and distributed graph coloring algorithms with performance analysis in random graph spaces
inferredcites →https://doi.org/10.1016/c2009-1-28569-8openalex-snapshot
A First Course in Stochastic Processes
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)1097-0118(199705)25:1<3::aid-jgt1>3.3.co;2-vopenalex-snapshot
Open problems of Paul Erdos in graph theory
inferred← citeshttps://doi.org/10.1002/(sici)1098-2418(199701/03)10:1/2<5::aid-rsa2>3.0.co;2-zopenalex-snapshot
Algorithmic theory of random graphs
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/jgt.23225openalex-snapshot
Independent Sets of Random Trees and Sparse Random Graphs
inferred← citeshttps://doi.org/10.1002/rsa.10113openalex-snapshot
Divide and conquer martingales and the number of triangles in a random graph
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.21078openalex-snapshot
The largest hole in sparse random graphs
inferred← citeshttps://doi.org/10.1002/rsa.3240010404openalex-snapshot
On the chromatic number of random graphs
inferred← citeshttps://doi.org/10.1002/rsa.3240060222openalex-snapshot
Generalized chromatic numbers of random graphs
inferred← citeshttps://doi.org/10.1002/rsa.3240070302openalex-snapshot
The Ramsey number R(3, t) has order of magnitude t2/log t
inferred← citeshttps://doi.org/10.1002/rsa.70014openalex-snapshot
The Clique Chromatic Number of Sparse Random Graphs
inferred← citeshttps://doi.org/10.1006/aama.1998.0595openalex-snapshot
Acyclic Orientations of Random Graphs
inferred← citeshttps://doi.org/10.1006/jagm.1996.0827openalex-snapshot
On-Line Coloring of Sparse Random Graphs and Random Trees
inferred← citeshttps://doi.org/10.1006/jcta.1996.0001openalex-snapshot
Asymptotically Good List-Colorings
inferred← citeshttps://doi.org/10.1007/3-540-45253-2_38openalex-snapshot
Coloring Sparse Random Graphs in Polynomial Average Time
inferred← citeshttps://doi.org/10.1007/3-540-57568-5_247openalex-snapshot
On quadratic lattice approximations
inferred← citeshttps://doi.org/10.1007/978-1-4613-0125-7_2openalex-snapshot
Concentration Inequalities
inferred← citeshttps://doi.org/10.1007/978-1-4613-0165-3_1openalex-snapshot
An Introduction to the Analysis of Iterative Coding Systems
inferred← citeshttps://doi.org/10.1007/978-1-4613-0303-9_16openalex-snapshot
The Graph Coloring Problem: A Bibliographic Survey
inferred← citeshttps://doi.org/10.1007/978-1-4614-7258-2_23openalex-snapshot
The Origins of the Theory of Random Graphs
inferred← citeshttps://doi.org/10.1007/978-1-4615-0013-1_18openalex-snapshot
Derandomization in Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/978-3-030-83823-2_8openalex-snapshot
The Largest Hole in Sparse Random Graphs
inferred← citeshttps://doi.org/10.1007/978-3-0348-8053-4_4openalex-snapshot
First-Passage Percolation
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-0348-8974-2_1openalex-snapshot
Randomness and Pseudo-Randomness in Discrete Mathematics
inferred← citeshttps://doi.org/10.1007/978-3-319-65816-2_4openalex-snapshot
Large Deviation Preliminaries
inferred← citeshttps://doi.org/10.1007/978-3-540-28650-9_9openalex-snapshot
Concentration Inequalities
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-03409-1_8openalex-snapshot
Martingales on Trees and the Empire Chromatic Number of Random Trees
inferred← citeshttps://doi.org/10.1007/978-3-642-22935-0_40openalex-snapshot
Independent Sets in Random Graphs from the Weighted Second Moment Method
inferred← citeshttps://doi.org/10.1007/978-3-642-60408-9_24openalex-snapshot
The Origins of the Theory of Random Graphs
inferred← citeshttps://doi.org/10.1007/bf01205080openalex-snapshot
A note on the sharp concentration of the chromatic number of random graphs
inferred← citeshttps://doi.org/10.1007/bf01215914openalex-snapshot
The concentration of the chromatic number of random graphs
inferred← citeshttps://doi.org/10.1007/bf01215921openalex-snapshot
On the minimal number of edges in color-critical graphs
inferred← citeshttps://doi.org/10.1007/bf01375472openalex-snapshot
The chromatic number of random graphs
inferred← citeshttps://doi.org/10.1007/bf02122551openalex-snapshot
The chromatic number of random graphs
inferred← citeshttps://doi.org/10.1007/bf02579304openalex-snapshot
Expose-and-merge exploration and the chromatic number of a random graph
inferred← citeshttps://doi.org/10.1007/bf02699376openalex-snapshot
Concentration of measure and isoperimetric inequalities in product spaces
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/0012-365x(90)90149-copenalex-snapshot
On the independence number of random graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(93)90322-kopenalex-snapshot
Spectra, Euclidean representations and clusterings of hypergraphs
inferred← citeshttps://doi.org/10.1016/0095-8956(92)90070-eopenalex-snapshot
On the independence and chromatic numbers of random regular graphs
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50008-7openalex-snapshot
10.1016/b978-044488002-4/50008-7
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.comgeo.2006.05.005openalex-snapshot
On the stabbing number of a random Delaunay triangulation
inferred← citeshttps://doi.org/10.1016/j.dam.2015.04.026openalex-snapshot
On coupon colorings of graphs
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.2015.01.020openalex-snapshot
Probabilistic constructions in generalized quadrangles
inferred← citeshttps://doi.org/10.1016/j.ejc.2009.03.004openalex-snapshot
Two remarks on the Burr–Erdős conjecture
inferred← citeshttps://doi.org/10.1016/j.endm.2011.09.052openalex-snapshot
On induced acyclic subgraphs in sparse random digraphs
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.laa.2010.01.036openalex-snapshot
Expected values of parameters associated with the minimum rank of a graph
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70399-6openalex-snapshot
Quo Vadis, Random Graph Theory?
inferred← citeshttps://doi.org/10.1016/s0167-7152(01)00177-8openalex-snapshot
The symmetry in the martingale inequality
inferred← citeshttps://doi.org/10.1017/cbo9780511662089.002openalex-snapshot
Restricted colorings of 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/s0001867800009307openalex-snapshot
On the size of a random sphere of influence graph
inferred← citeshttps://doi.org/10.1017/s0963548300001528openalex-snapshot
On Brooks' Theorem for Sparse Graphs
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/s0963548315000103openalex-snapshot
On the Method of Typical Bounded Differences
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/s0963548319000440openalex-snapshot
The replica symmetric phase of random constraint satisfaction problems
inferred← citeshttps://doi.org/10.1017/s0963548320000279openalex-snapshot
Independent dominating sets in graphs of girth five
inferred← citeshttps://doi.org/10.1017/s1446788700003591openalex-snapshot
Connectedness of graphs generated by a randomd-process
inferred← citeshttps://doi.org/10.1080/15427951.2012.749437openalex-snapshot
Concentration and Stability of Community-Detecting Functions on Random Networks
inferred← citeshttps://doi.org/10.1090/jams/957openalex-snapshot
Non-concentration of the chromatic number of a random graph
inferred← citeshttps://doi.org/10.1090/memo/1274openalex-snapshot
The Triangle-Free Process and the Ramsey Number 𝑅(3,𝑘)
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.2009.20openalex-snapshot
A New Probability Inequality Using Typical Moments and Concentration Results
inferred← citeshttps://doi.org/10.1109/focs.2013.48openalex-snapshot
Chasing the K-Colorability Threshold
inferred← citeshttps://doi.org/10.1109/sfcs.1987.45openalex-snapshot
On the second eigenvalue of random regular graphs
inferred← citeshttps://doi.org/10.1109/sfcs.1988.21939openalex-snapshot
Increasing the size of a network by a constant factor can increase performance by more than a constant factor
inferred← citeshttps://doi.org/10.1111/j.1749-6632.1989.tb16427.xopenalex-snapshot
Orders of Induced Subgraphs in Sparse Random Graphs
inferred← citeshttps://doi.org/10.1112/jlms.12794openalex-snapshot
How does the chromatic number of a random graph vary?
inferred← citeshttps://doi.org/10.1137/0221048openalex-snapshot
Increasing the Size of a Network by a Constant Factor can Increase Performance by More Than a Constant Factor
inferred← citeshttps://doi.org/10.1137/0405006openalex-snapshot
Generalized Chromatic Numbers of Random Graphs
inferred← citeshttps://doi.org/10.1137/1.9781611977073.36openalex-snapshot
Strong recovery of geometric planted matchings
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/22m1544476openalex-snapshot
On the Chromatic Number of Random Regular Hypergraphs
inferred← citeshttps://doi.org/10.1137/23m1556162openalex-snapshot
Acyclic Colorings of Graphs with Obstructions
inferred← citeshttps://doi.org/10.11429/emath1996.2007.autumn-meeting1_104openalex-snapshot
Poisson Cloning Model for Random Graphs
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/2465529.2465761openalex-snapshot
Efficient crowdsourcing for multi-class labeling
inferred← citeshttps://doi.org/10.1145/2494232.2465761openalex-snapshot
Efficient crowdsourcing for multi-class labeling
inferred← citeshttps://doi.org/10.1145/3087556.3087564openalex-snapshot
Improved Cover Time Bounds for the Coalescing-Branching Random Walk on Graphs
inferred← citeshttps://doi.org/10.1145/62212.62240openalex-snapshot
A randomized parallel branch-and-bound procedure
inferred← citeshttps://doi.org/10.1145/73007.73063openalex-snapshot
On the second eigenvalue of random regular graphs
inferred← citeshttps://doi.org/10.1214/aoap/1177004705openalex-snapshot
Probabilistic Analysis of an Algorithm in the Theory of Markets in Indivisible Goods
inferred← citeshttps://doi.org/10.1561/0100000064openalex-snapshot
Concentration of Measure Inequalities in Information Theory, Communications, and Coding
inferred← citeshttps://doi.org/10.17615/bcdg-wp57openalex-snapshot
Exceptional Rotations of Random Graphs: A VC Theory
inferred← citeshttps://doi.org/10.17771/pucrio.acad.61161openalex-snapshot
MODERATE DEVIATIONS OF TRIANGLE COUNTS IN SPARSE RANDOM GRAPHS
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.37236/331openalex-snapshot
The $t$-Stability Number of a Random Graph
inferred← citeshttps://doi.org/10.37236/9267openalex-snapshot
Structure and Colour in Triangle-Free Graphs
inferred← citeshttps://doi.org/10.4310/joc.2010.v1.n3.a2openalex-snapshot
The spectrum of random $k$-lifts of large graphs (with possibly large $k$)
inferred← citeshttps://doi.org/10.46298/dmtcs.2795openalex-snapshot
Induced acyclic subgraphs in random digraphs: Improved bounds
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.0803.1860openalex-snapshot
Two remarks on the Burr-Erdos conjecture
inferred← citeshttps://doi.org/10.48550/arxiv.0805.4133openalex-snapshot
Poisson Cloning Model for Random Graphs
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.0141openalex-snapshot
The t-stability number of a random graph
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.1111.1977openalex-snapshot
On Refined Versions of the Azuma-Hoeffding Inequality with Applications in Information Theory
inferred← citeshttps://doi.org/10.48550/arxiv.1203.5974openalex-snapshot
The Concentration and Stability of the Community Detecting Functions on Random Networks
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.1308.1899openalex-snapshot
Small maximal partial ovoids in generalized quadrangles
inferred← citeshttps://doi.org/10.48550/arxiv.1501.05471openalex-snapshot
Asymptotic Normality of the Chromatic Number of a Random Graph
inferred← citeshttps://doi.org/10.48550/arxiv.1506.02811openalex-snapshot
Exceptional rotations of random graphs: a VC theory
inferred← citeshttps://doi.org/10.48550/arxiv.1907.02539openalex-snapshot
Vector Colorings of Random, Ramanujan, and Large-Girth Irregular Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.2003.01902openalex-snapshot
Notes on Randomized Algorithms
inferred← citeshttps://doi.org/10.48550/arxiv.2006.04756openalex-snapshot
Independent Sets of Random Trees and of Sparse Random Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.2102.09289openalex-snapshot
Note on induced paths in sparse random graphs
inferred← citeshttps://doi.org/10.48550/arxiv.2109.07773openalex-snapshot
On the chromatic number of graphons
inferred← citeshttps://doi.org/10.5075/epfl-thesis-3485openalex-snapshot
Conservation laws for coding
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.