Using Lagrangians of hypergraphs to find non-jumping numbers. II. (Q879390): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: On extremal problems of graphs and generalized graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5567712 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the structure of linear graphs / rank
 
Normal rank
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: A note on the jumping constant conjecture of Erdős / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypergraphs do not jump / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5512796 / 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: Using Lagrangians of hypergraphs to find non-jumping numbers. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrangians of Hypergraphs / rank
 
Normal rank

Revision as of 17:57, 25 June 2024

scientific article
Language Label Description Also known as
English
Using Lagrangians of hypergraphs to find non-jumping numbers. II.
scientific article

    Statements

    Using Lagrangians of hypergraphs to find non-jumping numbers. II. (English)
    0 references
    11 May 2007
    0 references
    Erdős jumping constant conjecture
    0 references
    Lagrangian of an \(r\)-uniform graph
    0 references
    optimal vector
    0 references
    0 references

    Identifiers