Biblio Discovery — Demo Discovery Service

4 hasil untuk "David Conlon"

Menampilkan 1–4 · 0,10 detik · RSS

  1. Artikel Jurnal

    Sidorenko's conjecture for blow-ups

    David Conlon; Joonkyung Lee

    Discrete Analysis (2021) · 2021 · Inggris · DOAJ Scopus

    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…

  2. Artikel Jurnal

    Quasirandom Cayley graphs

    David Conlon; Yufei Zhao

    Discrete Analysis (2017) · 2017 · Inggris · DOAJ Scopus

    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…

  3. Artikel Jurnal

    Random multilinear maps and the Erdős box problem

    David Conlon; Cosmin Pohoata; Dmitriy Zakharov

    Discrete Analysis (2021) · 2021 · Inggris · DOAJ Scopus

    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…

  4. Artikel Jurnal

    A question of Erdős and Graham on Egyptian fractions

    David Conlon; Jacob Fox; Xiaoyu He dkk.

    Discrete Analysis (2025) · 2025 · Inggris · DOAJ Scopus

    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…