An extremal problem for sets with applications to graph theory (Q1066141): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A simple proof of the upper bound theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On generalized graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Conjecture of Erdos, Hajnal and Moon / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5558932 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3852212 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Problem in Graph Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extremal problem for two families of sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5642587 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3697032 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection patterns of convex sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hyperconnectivity of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of a problem of A. Ehrenfeucht and J. Mycielski / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4133994 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4106341 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5526641 / rank
 
Normal rank

Latest revision as of 19:26, 14 June 2024

scientific article
Language Label Description Also known as
English
An extremal problem for sets with applications to graph theory
scientific article

    Statements

    An extremal problem for sets with applications to graph theory (English)
    0 references
    1985
    0 references
    0 references
    0 references
    0 references
    0 references
    set partition
    0 references
    saturated graphs
    0 references
    saturated hypergraphs
    0 references
    0 references
    0 references
    0 references