Counting sets with small sumset, and the clique number of random Cayley graphs
From MaRDI portal
Publication:2387185
DOI10.1007/s00493-005-0018-2zbMath1110.11009arXivmath/0304183OpenAlexW1994148577MaRDI QIDQ2387185
Publication date: 5 October 2006
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0304183
Related Items (30)
Gauss sums and the maximum cliques in generalized Paley graphs of square order ⋮ Unnamed Item ⋮ On integral Cayley sum graphs ⋮ Random Latin square graphs ⋮ Unitary Addition Cayley Ring Signed Graphs * ⋮ Integral Cayley sum graphs and groups ⋮ On maximal cliques of Cayley graphs over fields ⋮ On the subgraphs of Cayley sum graphs ⋮ Random subgraphs of properly edge-coloured complete graphs and long rainbow cycles ⋮ The Connectivity of addition Cayley graphs ⋮ Maximality of subfields as cliques in Cayley graphs over finite fields ⋮ One-Point Concentration of the Clique and Chromatic Numbers of the Random Cayley Graph on $\mathbb{F}_2^n$ ⋮ Counting sets with small sumset and applications ⋮ On the Chromatic Number of Random Cayley Graphs ⋮ Cayley sum color and anti-circulant graphs ⋮ Difference sets and positive exponential sums. I: General properties ⋮ The Erdős–Moser Sum-free Set Problem ⋮ On subgraphs of random Cayley sum graphs ⋮ Sums and differences along Hamiltonian cycles ⋮ Sums and differences along Hamiltonian cycles ⋮ Sidon set systems ⋮ Large sets in finite fields are sumsets ⋮ The chromatic number of random Cayley graphs ⋮ Set systems with distinct sumsets ⋮ Extractors in Paley graphs: a random model ⋮ On Cayley sum graphs of non-abelian groups ⋮ A Cheeger type inequality in finite Cayley sum graphs ⋮ On the independence ratio of distance graphs ⋮ Sum-free subsets of finite abelian groups of type III ⋮ Connectivity of addition Cayley graphs
This page was built for publication: Counting sets with small sumset, and the clique number of random Cayley graphs
