Multicoloured extremal problems
Let \({\mathcal A}_1,\dots,{\mathcal A}_k\) be set systems on the finite underlying set \(X\) which are called colours. A finite configuration of subsets of \(X\) with \(f\) elements is multicoloured (for this set of colours) if one can find a listing \(H_1,\dots,H_f\) of the configuration and a permutation \(\pi\) of \(\{1,\dots,k\}\) such that \(H_i\) belongs to \({\mathcal A}_{\pi(i)}\) for all \(i\). A very general extremal problem class can be formulated as follows: Assume there is a list of forbidden configurations, and a natural number \(k.\) Find \(k\) set systems, that is, \(k\) colours with maximum total number of elements such that there is no multicoloured forbidden configuration (for this set of colours). If \(k=2\) and the two colour families are the same then we may get back to the classical extremal problems: If the forbidden configuration is a two-element chain, then we have the Sperner problem, while two disjoint subsets give us the Erdős-Ko-Rado problem. If, in more generality, we have \(k\) identical colour classes and the forbidden configuration is a \(k\)-chain, then we get back to the classical Erdős problem on \(k\)-chains. The problem for two-uniform colour systems (graphs) was introduced by the second author and the third author (with others). The paper under review starts a systematic investigation of the general problem. Results on multicoloured chains, intersecting set systems and Sauer-Shelah type set systems are proved.
- A combinatorial problem; stability and order for models and theories in infinitary languages
- A short proof of Sperner's lemma
- Generalization of Sperner’s Theorem on the Number of Subsets of a Finite Set
- scientific article; zbMATH DE number 3957109 (Why is no real title available?)
- scientific article; zbMATH DE number 3760172 (Why is no real title available?)
- scientific article; zbMATH DE number 3465294 (Why is no real title available?)
- scientific article; zbMATH DE number 487720 (Why is no real title available?)
- scientific article; zbMATH DE number 3221072 (Why is no real title available?)
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Logarithmic order of free distributive lattice
- On a lemma of Littlewood and Offord
- On generalized graphs
- On the density of families of sets
- On the density of sets of vectors
- On the trace of finite sets
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- Set Systems with Restricted Cross-Intersections and the Minimum Rank ofInclusion Matrices
- SETS OF INDEPENDENT EDGES OF A HYPERGRAPH
- Colourings without monochromatic disjoint pairs
- Several families with incomparability and complementarity conditions
- Colouring set families without monochromatic k-chains
- A remark on the number of edge colorings of graphs
- Colouring multijoints
- Multicolour sunflowers
- A rainbow Erdös-Rothschild problem
- scientific article; zbMATH DE number 3999957 (Why is no real title available?)
- Multicolor containers, extremal entropy, and counting
- Set systems containing many maximal chains
- scientific article; zbMATH DE number 4185671 (Why is no real title available?)
- Localized versions of extremal problems
- Rainbow Hamiltonicity and the spectral radius
This page was built for publication: Multicoloured extremal problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1883144)
