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
Parents
10
Forbidden configurations for distributive and modular ordered sets
Ivan Chajda, Jiří Rachůnek · Order · 1989 · 31 citations
Small Forbidden Configurations IV: The 3 Rowed Case
R.P. Anstee, Attila Sali · COMBINATORICA · 2005 · 20 citations
1–5 of 10
14
6
h-index
3
h-index
1
h-index
Institut national de recherche en sciences et technologies du numérique, France
1 publications · 96 citations
1
h-index
1
h-index
1–5 of 14
12

University of British Columbia
Vancouver, Canada
5 h-index
10 publications
178 citations

Alfréd Rényi Institute of Mathematics
Budapest, Hungary
3 h-index
6 publications
133 citations

Hungarian Academy of Sciences
Budapest, Hungary
2 h-index
4 publications
107 citations

University of Waterloo
Waterloo, Canada
1 h-index
1 publications
15 citations
Palacký University Olomouc
Olomouc, Czechia
1 h-index
2 publications
62 citations
California Institute of Technology
Pasadena, United States
1 h-index
1 publications
12 citations

Urbana University
Urbana, United States
1 h-index
1 publications
13 citations
Laboratoire de Génie Informatique, de Production et de Maintenance
Metz, France
1 h-index
3 publications
288 citations
1–8 of 12
2 publications · 48 citations
2
h-index
MLQ · 1 publications · 49 citations
1
h-index
1 publications · 96 citations
1
h-index
DMTCS · 1 publications · 13 citations
1
h-index
1 publications · 31 citations
1
h-index
1–5