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

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
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

Latest revision as of 17:17, 22 May 2024

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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references