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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 05:52, 10 July 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