Projects
Reading
People
Chat
SU\G
(𝔸)
/K·U
Projects
Reading
People
Chat
Sign Up
Light
Dark
System
Erlang Surya
Follow
Share
Generating author description...
All published works
Action
Title
Year
Authors
+
PDF
Chat
On the Concentration of the Chromatic Number of Random Graphs
2024
Erlang Surya
Lutz Warnke
+
PDF
Chat
Lagrange Inversion Formula by Induction
2023
Erlang Surya
Lutz Warnke
+
Isomorphisms between dense random graphs
2023
Erlang Surya
Lutz Warnke
Emily Zhu
+
On the concentration of the chromatic number of random graphs
2022
Erlang Surya
Lutz Warnke
+
The degree-restricted random process is far from uniform
2022
Michael Molloy
Erlang Surya
Lutz Warnke
Common Coauthors
Coauthor
Papers Together
Lutz Warnke
5
Emily Zhu
1
Michael Molloy
1
Commonly Cited References
Action
Title
Year
Authors
# of times referenced
+
PDF
Chat
On the Chromatic Number in the Stochastic Block Model
2023
Mikhail Isaev
Mihyun Kang
2
+
Matching and covering the vertices of a random graph by copies of a given graph
1992
Andrzej Ruciński
2
+
PDF
Chat
The chromatic number of random graphs
1991
Tomasz Łuczak
2
+
PDF
Chat
The concentration of the chromatic number of random graphs
1997
Noga Alon
Michael Krivelevich
2
+
A note on the sharp concentration of the chromatic number of random graphs
1991
Tomasz Łuczak
2
+
The chromatic number of random graphs
1988
B Bollobás
2
+
On colouring random graphs
1975
Geoffrey Grimmett
Colin McDiarmid
2
+
How Sharp is the Concentration of the Chromatic Number?
2004
B�la Bollob�s
2
+
PDF
Chat
The two possible values of the chromatic number of a random graph
2004
Dimitris Achlioptas
Assaf Naor
2
+
Poisson approximation for large deviations
1990
Svante Janson
2
+
PDF
Chat
Clique coloring of binomial random graphs
2018
Colin McDiarmid
Dieter Mitsche
Paweł Prałat
2
+
On the method of bounded differences
1989
Colin McDiarmid
2
+
Non-concentration of the chromatic number of a random graph
2020
Annika Heckel
2
+
PDF
Chat
On the Method of Typical Bounded Differences
2015
Lutz Warnke
2
+
PDF
Chat
Prague Dimension of Random Graphs
2023
He Guo
Kalen Patton
Lutz Warnke
2
+
PDF
Chat
The Janson inequalities for general up‐sets
2013
Oliver Riordan
Lutz Warnke
2
+
PDF
Chat
The jump of the clique chromatic number of random graphs
2023
Lyuben Lichev
Dieter Mitsche
Lutz Warnke
2
+
Concentration for self‐bounding functions and an inequality of Talagrand
2006
Colin McDiarmid
Bruce Reed
2
+
On the concentration of the chromatic number of random graphs
2008
Alex Scott
2
+
On the minimal number of edges in color-critical graphs
1997
Michael Krivelevich
2
+
PDF
Chat
When are small subgraphs of a random graph normally distributed?
1988
Andrzej Ruciński
2
+
Combinatorial Species and Tree-like Structures
1997
François Bergeron
Gilbert Labelle
Pierre Leroux
1
+
Enumerative Combinatorics
1999
Richard P. Stanley
Sergey Fomin
1
+
Integral Representation and the Computation of Combinatorial Sums
1984
G. Egorychev
1
+
A ridiculously simple and explicit implicit function theorem
2009
Alan D. Sokal
1
+
Analytic Combinatorics
2009
Philippe Flajolet
Robert Sedgewick
1
+
Advanced Combinatorics
1974
Louis Comtet
1
+
Introduction to Enumerative and Analytic Combinatorics
2015
Miklós Bóna
1
+
PDF
Chat
Operator methods and Lagrange inversion: a unified approach to Lagrange formulas
1988
Ch. Krattenthaler
1
+
Formal Power Series
1969
Ivan Niven
1
+
The Method of Coefficients
2007
Donatella Merlini
Renzo Sprugnoli
M. Cecilia Verri
1
+
Combinatorial Enumeration
2024
Robin Pemantle
Mark C. Wilson
Stephen Melczer
1
+
Lagrange Inversion: When and How
2006
Donatella Merlini
Rachele Sprugnoli
M. Cecilia Verri
1
+
Lagrange inversion
2016
Ira M. Gessel
1
+
A combinatorial proof of the multivariable lagrange inversion formula
1987
Ira M. Gessel
1
+
Enumerative Combinatorics
2011
Richard P. Stanley
1
+
PDF
Chat
Operator Methods and Lagrange Inversion: A Unified Approach to Lagrange Formulas
1988
Ch. Krattenthaler
1
+
Enumerative Combinatorics
1986
Richard P. Stanley
1
+
Advanced Combinatorics: The Art of Finite and Infinite Expansions
1974
Louis Comtet
J.W. Nienhuys
1