Dependent Random Choice

Dependent Random Choice is a probabilistic method in extremal combinatorics that selects vertices in a graph based on the adjacency structure to guarantee the existence of dense subsets with prescribed intersection properties.

7

Publications

397

Citations

18

Authors

14

Institutions

Publications per year

2017–2026

1

Authors

18

  1. AW
    Anton Wutz

    Research Institute of Molecular Pathology, Austria

    1 publications · 96 citations

    1

    h-index

  2. EP
    Emil Powierski

    1 publications · 12 citations

    1

    h-index

  3. BS
    Benny Sudakov

    Princeton University, United States

    1 publications · 126 citations

    1

    h-index

  4. BP
    Barbara Panning

    University of California, San Francisco, United States

    1 publications · 96 citations

    1

    h-index

  5. GF
    Graham F. Kay

    QIMR Berghofer Medical Research Institute, Australia

    1 publications · 96 citations

    1

    h-index

1–5 of 18

Venues

  1. arXiv (Cornell University)

    Repository · 1 publications · 12 citations

    1

    h-index

  2. Transactions of the American Mathematical Society

    TRAN · 1 publications · 26 citations

    1

    h-index

  3. Annals of Pure and Applied Logic

    1 publications · 15 citations

    1

    h-index

  4. Archive for Mathematical Logic

    1 publications · 12 citations

    1

    h-index

  5. Nature Structural & Molecular Biology

    1 publications · 96 citations

    1

    h-index

1–5