Many \(T\) copies in \(H\)-free graphs (Q5965526): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.jctb.2016.03.004 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1533675320 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of subgraphs of prescribed type of graphs with a given number of edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient testing of large graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructive lower bounds for off-diagonal Ramsey numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharp bounds for some multicolour Ramsey numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Norm-graphs: Variations and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent sets in hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Sets of Integers Which Contain No Three Terms in Arithmetical Progression / rank
 
Normal rank
Property / cites work
 
Property / cites work: On complete subgraphs of different orders / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pentagons vs. triangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles of even length in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Graphs that do not Contain a Thomsen Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Erratum For ‘A Bound on the Number of Edges in Graphs Without an Even Cycle’ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial theorems in sparse random sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5724802 / 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: On maximal paths and circuits of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the structure of linear graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new proof of the graph removal lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large triangle-free subgraphs in graphs without \(K_ 4\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: New asymptotics for bipartite Turán numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of edges of quadrilateral-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On 3-uniform hypergraphs without a cycle of a given length / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing the Number of Independent Sets of a Fixed Size / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximum number of five-cycles in a triangle-free graph / 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: On the maximal number of certain subgraphs in \(K_ r\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of pentagons in triangle-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper tails for subgraph counts in random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(K^ 4\)-free subgraphs of random graphs / 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: On a problem of K. Zarankiewicz / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5477817 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On hypergraphs of girth five / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs with many <i>r</i> -cliques have large complete <i>r</i> -partite subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Threshold Functions for Ramsey Properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4175585 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypergraph containers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal results for random discrete structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5689007 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the spectrum of projective norm-graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5781249 / rank
 
Normal rank

Latest revision as of 16:59, 12 July 2024

scientific article; zbMATH DE number 6637919
Language Label Description Also known as
English
Many \(T\) copies in \(H\)-free graphs
scientific article; zbMATH DE number 6637919

    Statements

    Many \(T\) copies in \(H\)-free graphs (English)
    0 references
    0 references
    0 references
    12 October 2016
    0 references
    extremal graph theory
    0 references
    \(H\)-free graphs
    0 references
    projective norm graphs
    0 references
    complete graphs
    0 references
    complete bipartite graphs
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers