Fetching the paper…
Reading the bibliography…
We prove that a random Cayley graph on a group of order $N$ has clique number $O(\log N \log \log N)$ with high probability.
P. Erdős and G. Szekeres, A combinatorial problem in geometry, Compos. Math
1935
Earlier work this paper cites.
P. Erdős, Some remarks on the theory of graphs, Bull. Amer. Math. Soc
1947
Earlier work this paper cites.
R. Otter, The number of trees, Ann. Math
1948
Earlier work this paper cites.
V. G. Vizing, On an estimate of the chromatic class of a p p -graph, Diskret. Analiz
1964
Earlier work this paper cites.
P. Erdős, A. Hajnal and R. Rado, Partition relations for cardinal numbers, Acta Math. Acad. Sci. Hungar
1965
Earlier work this paper cites.
P. Erdős and A. Szemerédi, On a Ramsey type theorem, Period. Math. Hungar
1972
Earlier work this paper cites.
B. Bollobás and P. Erdős, Cliques in random graphs, Math. Proc. Cambridge Philos. Soc
1976
Earlier work this paper cites.
D. W. Matula, The largest clique size in a random graph, Technical report CS 7608, Southern Methodist University, Dallas, TX, 1976
1976
Earlier work this paper cites.
P. K. Agarwal, N. Alon, B. Aronov and S. Suri, Can visibility graphs be represented compactly?, Discrete Comput. Geom
1994
Earlier work this paper cites.
N. Alon, Research problems, Discrete Math
1995
Earlier work this paper cites.
N. Alon and A. Orlitsky, Repeated communication and Ramsey graphs, IEEE Trans. Inform. Theory
1995
Cited alongside, same era.
C. McDiarmid and A. Steger, Tidier Examples for Lower Bounds on Diagonal Ramsey Numbers, J. Combin. Theory Ser. A
1996
Cited alongside, same era.
I. Z. Ruzsa, An analog of Freiman’s theorem in groups, Astérisque
1999
Cited alongside, same era.
N. Alon, Graph powers, in Contemporary combinatorics, 11–28, Bolyai Soc. Math. Stud., 10, János Bolyai Math. Soc., Budapest, 2002
2002
Cited alongside, same era.
B. Green, Counting sets with small sumset, and the clique number of random Cayley graphs, Combinatorica
2005
Cited alongside, same era.
T. Sanders, On a theorem of Shkredov, Online J. Anal. Comb
B. Green and R. Morris, Counting sets with small sumset and applications, Combinatorica
2016
Later among the works it cites.
T. Schoen and I. D. Shkredov, Additive dimension and a theorem of Sanders, J. Aust. Math. Soc
2016
Later among the works it cites.
R. Mrazović, One-point concentration of the clique and chromatic numbers of the random Cayley graph on 𝔽 2 n \mathbb{F}_{2}^{n} , SIAM J. Discrete Math
2017
Later among the works it cites.
S. V. Konyagin and I. D. Shkredov, On subgraphs of random Cayley sum graphs, European J. Combin
2018
Later among the works it cites.
M. Campos, On the number of sets with a given doubling constant, Israel J. Math
2020
Later among the works it cites.
T. Sanders, Bootstrapping partition regularity of linear systems, Proc. Edinb. Math. Soc
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2010
Cited alongside, same era.
D. Christofides and K. Markström, Random Latin square graphs, Random Structures Algorithms
2012
Cited alongside, same era.
C. Even-Zohar, On sums of generating sets in ℤ 2 n \mathbb{Z}_{2}^{n} , Combin. Probab. Comput
2012
Cited alongside, same era.
N. Alon, The chromatic number of random Cayley graphs, European J. Combin
2013
Cited alongside, same era.
C. Even-Zohar and S. Lovett, The Freiman–Ruzsa theorem over finite fields, J. Combin. Theory Ser. A
2014
Cited alongside, same era.
N. Alon, Ramsey properties of Cayley graphs, Open problem garden, available at http://www.openproblemgarden.org/op/ramsey_properties_of_cayley_graphs
Cited in the paper.
Cited in the paper.
2020
Later among the works it cites.
M. Campos, M. Collares, R. Morris, N. Morrison and V. Souza, The typical structure of sets with small sumset, Int. Math. Res. Not. IMRN
2022
Later among the works it cites.
E. Chattopadhyay and J.-J. Liao, Extractors for sum of two sources, in STOC ’22 — Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing, 1584–1597, Association for Computing Machinery (ACM), New York, 2022
2022
Later among the works it cites.
M. Campos, M. Coulson, O. Serra and M. Wötzel, The typical approximate structure of sets with bounded sumset, SIAM J. Discrete Math
2023
Later among the works it cites.