4 hasil untuk "David Conlon"
Menampilkan 1–4 · 0,10 detik · RSS
-
Artikel Jurnal
Sidorenko's conjecture for blow-ups
Sidorenko's conjecture for blow-ups, Discrete Analysis 2021:2, 13 pp. Let $G$ be a bipartite graph with finite vertex sets $X$ and $Y$. If $G$ has density $\alpha$, then the average degree of the vertices in $X$ is $\alpha|Y|$, so the mean-square degree is at least $\alpha^2|Y|^2$. This is easily…
-
Artikel Jurnal
Quasirandom Cayley graphs
Quasirandom Cayley graphs, Discrete Analysis 2017:6, 14 pp. An extremely important phenomenon in extremal combinatorics is that of _quasirandomness_: for many combinatorial structures, it is possible to identify a list of deterministic properties, each one of which says in one way or another that…
-
Artikel Jurnal
Random multilinear maps and the Erdős box problem
Random multilinear maps and the Erdős box problem, Discrete Analysis 2021:17, 8 pp. A major theme in extremal combinatorics is determining the maximum number of edges that a graph or hypergraph can have if it does not contain a certain fixed graph or hypergraph. In the case of graphs, Turán's…
-
Artikel Jurnal
A question of Erdős and Graham on Egyptian fractions
A question of Erdős and Graham on Egyptian fractions, Discrete Analysis 2025:28, 13 pp. An _Egyptian fraction_ is a way of writing a rational number as a sum of reciprocals of positive integers with distinct denominators. It is a nice exercise to show that every rational number can be written in…