pith. sign in

arxiv: 1708.01822 · v3 · pith:FU7YBFX5new · submitted 2017-08-05 · 🧮 math.CO

Maximum star densities

classification 🧮 math.CO
keywords gammacliqueedgenumberstarsahlswedeasymptoticallycannot
0
0 comments X
read the original abstract

Given an integer $k \geq 2$ and a real number $\gamma\in [0, 1]$, which graphs of edge density $\gamma$ contain the largest number of $k$-edge stars? For $k=2$ Ahlswede and Katona proved that asymptotically there cannot be more such stars than in a clique or in the complement of a clique (depending on the value of $\gamma$). Here we extend their result to all integers $k\ge 2$.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.