On graphs that contain exactly \(k\) copies of a subgraph, and a related problem in search theory (Q6069164): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3994535 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3355250 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning a Hidden Subgraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3885778 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3491635 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5567712 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compactness results in extremal graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Supersaturated graphs and hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the structure of linear graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of edge-disjoint triangles in \(K_4\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum graphs with a unique k-factor / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal bipartite graphs with a unique k-factor / rank
 
Normal rank
Property / cites work
 
Property / cites work: On unique \(k\)-factors and unique \([1,k]\)-factors in graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the structure of graphs with a uniquek-factor / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the structure of factorizable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON A PROBLEM OF ERDŐS ABOUT GRAPHS WHOSE SIZE IS THE TURÁN NUMBER PLUS ONE / rank
 
Normal rank
Property / cites work
 
Property / cites work: The clique density theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs with exactly one hamiltonian circuit / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5781249 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum size of graphs with a unique \(k\)-factor / rank
 
Normal rank

Latest revision as of 13:19, 3 August 2024

scientific article; zbMATH DE number 7764556
Language Label Description Also known as
English
On graphs that contain exactly \(k\) copies of a subgraph, and a related problem in search theory
scientific article; zbMATH DE number 7764556

    Statements

    On graphs that contain exactly \(k\) copies of a subgraph, and a related problem in search theory (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    13 November 2023
    0 references
    subgraph
    0 references
    graph algorithm
    0 references
    Turán number
    0 references
    search theory
    0 references
    query
    0 references
    game
    0 references

    Identifiers

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