Free Set Theorems

Free Set Theorems is a theorem-level result in combinatorial set theory that characterizes conditions under which a function-defined dependency relation admits a free set—a subset on which the function values lie outside the subset—thereby generalizing canonical Ramsey-type partition results.

43

Publications

1.7K

Citations

54

Authors

49

Institutions

Publications per year

2017–2026

1

Authors

54

  1. SS
    Saharon Shelah

    Hebrew University of Jerusalem, Israel

    4 publications · 238 citations

    4

    h-index

  2. TS
    Tomasz Schoen

    Adam Mickiewicz University in Poznań, Poland

    3 publications · 67 citations

    3

    h-index

  3. VF
    Vsevolod F. Lev

    University of Haifa, Israel

    3 publications · 81 citations

    3

    h-index

  4. TŁ
    Tomasz Łuczak

    Adam Mickiewicz University in Poznań, Poland

    2 publications · 57 citations

    2

    h-index

  5. OS
    Otmar Spinas

    ETH Zurich, Switzerland

    2 publications · 25 citations

    2

    h-index

1–5 of 54

Venues

  1. Israel Journal of Mathematics

    8 publications · 465 citations

    8

    h-index

  2. Journal of Symbolic Logic

    4 publications · 89 citations

    4

    h-index

  3. Journal of Pure and Applied Algebra

    3 publications · 62 citations

    3

    h-index

  4. The Electronic Journal of Combinatorics

    2 publications · 60 citations

    2

    h-index

  5. Journal of Combinatorial Theory Series A

    2 publications · 47 citations

    2

    h-index

1–5