The inducibility of complete bipartite graphs (Q4309990): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import recommendations run Q6534273
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1002/jgt.3190180610 / 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: The maximal number of induced complete bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Digraph extremal problems, hypergraph extremal problems, and the densities of graph structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3795701 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3880877 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypergraphs do not jump / rank
 
Normal rank
Property / cites work
 
Property / cites work: The edge inducibility of graphs / 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: The inducibility of graphs / 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: Asymptotic solution for a new class of forbidden r-graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremals of functions on graphs with applications to graphs and hypergraphs / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1002/JGT.3190180610 / rank
 
Normal rank
Property / Recommended article
 
Property / Recommended article: Q3752410 / rank
 
Normal rank
Property / Recommended article: Q3752410 / qualifier
 
Similarity Score: 0.8521859
Amount0.8521859
Unit1
Property / Recommended article: Q3752410 / qualifier
 
Property / Recommended article
 
Property / Recommended article: The size of a maximum subgraph of the random graph with a given number of edges / rank
 
Normal rank
Property / Recommended article: The size of a maximum subgraph of the random graph with a given number of edges / qualifier
 
Similarity Score: 0.8170657
Amount0.8170657
Unit1
Property / Recommended article: The size of a maximum subgraph of the random graph with a given number of edges / qualifier
 
Property / Recommended article
 
Property / Recommended article: On the exact maximum induced density of almost all graphs and their inducibility / rank
 
Normal rank
Property / Recommended article: On the exact maximum induced density of almost all graphs and their inducibility / qualifier
 
Similarity Score: 0.8127942
Amount0.8127942
Unit1
Property / Recommended article: On the exact maximum induced density of almost all graphs and their inducibility / qualifier
 
Property / Recommended article
 
Property / Recommended article: Edge-statistics on large graphs / rank
 
Normal rank
Property / Recommended article: Edge-statistics on large graphs / qualifier
 
Similarity Score: 0.79981995
Amount0.79981995
Unit1
Property / Recommended article: Edge-statistics on large graphs / qualifier
 
Property / Recommended article
 
Property / Recommended article: Large Induced Matchings in Random Graphs / rank
 
Normal rank
Property / Recommended article: Large Induced Matchings in Random Graphs / qualifier
 
Similarity Score: 0.78941077
Amount0.78941077
Unit1
Property / Recommended article: Large Induced Matchings in Random Graphs / qualifier
 
Property / Recommended article
 
Property / Recommended article: Q3795701 / rank
 
Normal rank
Property / Recommended article: Q3795701 / qualifier
 
Similarity Score: 0.7885733
Amount0.7885733
Unit1
Property / Recommended article: Q3795701 / qualifier
 
Property / Recommended article
 
Property / Recommended article: On coloring graphs to maximize the proportion of multicolored k-edges / rank
 
Normal rank
Property / Recommended article: On coloring graphs to maximize the proportion of multicolored k-edges / qualifier
 
Similarity Score: 0.78384984
Amount0.78384984
Unit1
Property / Recommended article: On coloring graphs to maximize the proportion of multicolored k-edges / qualifier
 
Property / Recommended article
 
Property / Recommended article: On the number of induced subgraphs of a random graph / rank
 
Normal rank
Property / Recommended article: On the number of induced subgraphs of a random graph / qualifier
 
Similarity Score: 0.78162503
Amount0.78162503
Unit1
Property / Recommended article: On the number of induced subgraphs of a random graph / qualifier
 
Property / Recommended article
 
Property / Recommended article: A parametric analysis of the largest induced tree problem in random graphs / rank
 
Normal rank
Property / Recommended article: A parametric analysis of the largest induced tree problem in random graphs / qualifier
 
Similarity Score: 0.7786894
Amount0.7786894
Unit1
Property / Recommended article: A parametric analysis of the largest induced tree problem in random graphs / qualifier
 
Property / Recommended article
 
Property / Recommended article: Q5567712 / rank
 
Normal rank
Property / Recommended article: Q5567712 / qualifier
 
Similarity Score: 0.7761245
Amount0.7761245
Unit1
Property / Recommended article: Q5567712 / qualifier
 

Latest revision as of 20:09, 27 January 2025

scientific article; zbMATH DE number 665815
Language Label Description Also known as
English
The inducibility of complete bipartite graphs
scientific article; zbMATH DE number 665815

    Statements

    The inducibility of complete bipartite graphs (English)
    0 references
    0 references
    0 references
    9 April 1995
    0 references
    inducibility
    0 references
    asymptotically optimal
    0 references
    complete multipartite graphs
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references