Unavoidable subhypergraphs: \(\mathbf a\)-clusters (Q640838): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Zoltan Fueredi / rank
Normal rank
 
Property / author
 
Property / author: Zoltan Fueredi / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jcta.2011.05.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2069654053 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counterexample to the Frankl-Pach conjecture for uniform, dense families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4718790 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On generalized graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Families of Sets with Intersecting Clusters / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Extremal Set-Intersection Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Sperner families satisfying an additional condition / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new generalization of the Erdős-Ko-Rado theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forbidding just one intersection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact solution of some Turán-type problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On disjointly representable sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On finite set-systems whose every intersection is a kernel of a star / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set Systems without a Strong Simplex / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set systems without a simplex or a cluster / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3880849 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Erdős--Ko--Rado for three sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: An intersection theorem for four sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set systems with union and intersection constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of a conjecture of Erdős on triangles in set-systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the VC-dimension of uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a packing and covering problem / rank
 
Normal rank

Latest revision as of 14:02, 4 July 2024

scientific article
Language Label Description Also known as
English
Unavoidable subhypergraphs: \(\mathbf a\)-clusters
scientific article

    Statements

    Unavoidable subhypergraphs: \(\mathbf a\)-clusters (English)
    0 references
    0 references
    0 references
    21 October 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    Erdős-Ko-Rado
    0 references
    hypergraphs
    0 references
    traces
    0 references
    0 references