Forbidden Configuration Problems

Forbidden Configuration Problems is a class of extremal combinatorics problems in set system theory that seeks to determine the maximum number of sets in a family over a finite universe that avoids containing a specified forbidden subconfiguration, distinguished by the restriction that no subset arrangement isomorphic to the forbidden configuration may appear in the incidence matrix representation of the family.

10

Publications

295

Citations

14

Authors

12

Institutions

Publications per year

2017–2026

0

Variants

Forbidden Subconfiguration Problems

Authors

14

  1. RA
    R.P. Anstee

    University of British Columbia, Canada

    6 publications · 108 citations

    6

    h-index

  2. AS
    Attila Sali

    Alfréd Rényi Institute of Mathematics, Hungary

    3 publications · 62 citations

    3

    h-index

  3. RF
    Ron Ferguson

    Simon Fraser University, Canada

    1 publications · 29 citations

    1

    h-index

  4. AG
    A. Ghaffari

    Institut national de recherche en sciences et technologies du numérique, France

    1 publications · 96 citations

    1

    h-index

  5. BF
    Balin Fleming

    University of British Columbia, Canada

    1 publications · 13 citations

    1

    h-index

1–5 of 14

Venues

  1. The Electronic Journal of Combinatorics

    2 publications · 48 citations

    2

    h-index

  2. Mathematical logic quarterly

    MLQ · 1 publications · 49 citations

    1

    h-index

  3. IEEE Transactions on Automatic Control

    1 publications · 96 citations

    1

    h-index

  4. Discrete Mathematics & Theoretical Computer Science

    DMTCS · 1 publications · 13 citations

    1

    h-index

  5. Order

    1 publications · 31 citations

    1

    h-index

1–5