Counting sets with small sumset, and the clique number of random Cayley graphs

Type: Preprint

Publication Date: 2003-01-01

Citations: 0

DOI: https://doi.org/10.48550/arxiv.math/0304183

Locations

  • arXiv (Cornell University) - View
  • DataCite API - View

Similar Works

Action Title Year Authors
+ PDF Chat Counting Sets With Small Sumset, And The Clique Number Of Random Cayley Graphs 2005 Ben Green
+ Number of sets with small sumset and the clique number of random Cayley graphs 2007 Gyan Prakash
+ Counting sets with small sumset and applications 2013 Ben Green
Robert Morris
+ PDF Chat Counting sets with small sumset and applications 2015 Ben Green
Robert Morris
+ Large cliques and independent sets all over the place 2020 Noga Alon
Matija Bucić
Benny Sudakov
+ PDF Chat On the number of sets with small sumset 2024 Dingyuan Liu
Letícia Mattos
Tibor Szabó
+ Topics in additive combinatorics 2016 Rudi Mrazović
+ The random greedy algorithm for sum-free subsets of $\mathbb{Z}_{2n}$ 2015 Patrick Bennett
+ PDF Chat On the independence number of sparser random Cayley graphs 2024 Marcelo Campos
Gabriel Dahia
João Pedro Marciano
+ A Sublinear Time Randomized Algorithm for Coset Enumeration in the Black Box Model 2008 Bin Fu
Zhixiang Chen
+ Regular Sets in Cayley Sum Graphs 2025 Fateme Sadat Seiedali
Behrooz Khosravi
Zeinab Akhlaghi
+ Clique number of random Cayley graph 2007 Gyan Prakash
+ PDF Chat The Sum-Free Process 2020 Patrick Bennett
+ PDF Chat On the clique number of random Cayley graphs and related topics 2024 David Conlon
Jacob Fox
Huy Tuan Pham
Liana Yepremyan
+ The sum-free process 2015 Patrick Bennett
+ The sum-capture problem for abelian groups 2013 John P. Steinberger
+ The sum-capture problem for abelian groups 2013 John Steinberger
+ On the structure of a random sum-free set of positive integers 1998 Neil J. Calkin
+ On regular sets in Cayley sum graphs 2024 Junyang Zhang
Wei Yuan
+ The trivial lower bound for the girth of $S_n$ 2017 Sean Eberhard

Works That Cite This (0)

Action Title Year Authors