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

DOI10.1016/j.dam.2023.08.012zbMath1526.05072arXiv2210.04712MaRDI QIDQ6069164

Dániel Gerbner, Balázs Patkós, Balázs Keszegh, Gábor Wiener, Máté Vizer, Dömötör Pálvölgyi, Dániel Lenger, Dániel T. Nagy

Publication date: 13 November 2023

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2210.04712

zbMATH Keywords

graph algorithmgamesearch theorysubgraphqueryTurán number

Mathematics Subject Classification ID

Searching and sorting (68P10) Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The clique density theorem
• The maximum size of graphs with a unique \(k\)-factor
• Supersaturated graphs and hypergraphs
• Maximum graphs with a unique k-factor
• On unique \(k\)-factors and unique \([1,k\)-factors in graphs.]
• Compactness results in extremal graph theory
• Extremal bipartite graphs with a unique k-factor
• Graphs with exactly one hamiltonian circuit
• On the structure of graphs with a uniquek-factor
• ON A PROBLEM OF ERDŐS ABOUT GRAPHS WHOSE SIZE IS THE TURÁN NUMBER PLUS ONE
• Learning a Hidden Subgraph
• On the structure of factorizable graphs
• On the structure of linear graphs
• On the number of edge-disjoint triangles in \(K_4\)-free graphs

This page was built for publication: On graphs that contain exactly \(k\) copies of a subgraph, and a related problem in search theory