Turán numbers for Berge-hypergraphs and related extremal problems (Q1999723): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Norm-graphs: Variations and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Many \(T\) copies in \(H\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal subgraphs of random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pentagons vs. triangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Erdős-Gallai type theorem for uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On extremal problems of graphs and generalized graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotics for Turán numbers of cycles in 3-uniform linear hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Ramsey graphs for the four-cycle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear trees in uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypergraph Turán numbers of linear cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact solution of the hypergraph Turán problem for \(k\)-uniform linear paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotics for the Turán number of Berge-\(K_{2,t}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal Results for Berge Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Maximum Number of Triangles in <i>C</i><sub>2<i>k</i>+1</sub>-Free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypergraph extensions of the Erdős-Gallai theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of graphs without 4-cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of Sidon sets and the maximum size of Sidon sets contained in a sparse random set of integers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Norm-graphs and bipartite Turán numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Turán problems and shadows. I: Paths and cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Turán Problems and Shadows III: Expansions of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Turán problems and shadows. II: Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On hypergraphs of girth five / rank
 
Normal rank
Property / cites work
 
Property / cites work: New lower bounds on the multicolor Ramsey numbers \(r_k(C_4)\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hypergraph extension of Turán's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of Turán problems for expansions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact computation of the hypergraph Turán function for expanded complete 2-graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting independent sets in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(r\)-uniform linear hypergraphs with no Berge-\(K_{2,t}\) / rank
 
Normal rank

Latest revision as of 16:58, 19 July 2024

scientific article
Language Label Description Also known as
English
Turán numbers for Berge-hypergraphs and related extremal problems
scientific article

    Statements

    Turán numbers for Berge-hypergraphs and related extremal problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    27 June 2019
    0 references
    Berge hypergraph
    0 references
    Turán number
    0 references
    extremal problems
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references