On graph-Lagrangians and clique numbers of 3-uniform hypergraphs (Q326974): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Extremal problems whose solutions are the blowups of the small Witt- designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypergraphs do not jump / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hypergraph Turán theorem via Lagrangians of intersecting families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3089368 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maxima for Graphs and a New Proof of a Theorem of Turán / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Lagrangians of \(r\)-uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Motzkin-Straus type result for 3-uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximal number of edges in a homogeneous hypergraph not containing prohibited subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the largest graph-Lagrangian of 3-graphs with fixed number of edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrangians of Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Frankl and Füredi's conjecture for 3-uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some results on Lagrangians of hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On graph-Lagrangians of hypergraphs containing dense subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5781249 / rank
 
Normal rank

Latest revision as of 18:03, 12 July 2024

scientific article
Language Label Description Also known as
English
On graph-Lagrangians and clique numbers of 3-uniform hypergraphs
scientific article

    Statements

    On graph-Lagrangians and clique numbers of 3-uniform hypergraphs (English)
    0 references
    0 references
    0 references
    0 references
    13 October 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    Lagrangians of hypergraphs
    0 references
    extremal problems in hypergraphs
    0 references
    0 references