Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
subgraph containment
Description:
A graph-theoretic relation or decision problem asking whether one graph occurs as a subgraph of another.
Primary topic:
Limits and Structures in Graph Theory (68%)
Related topics:
Limits and Structures in Graph Theory (68%),
Advanced Graph Theory Research (15%)
OpenAlex ID:
keywords/subgraph-containment
The Ramsey number of a graph with bounded maximum degree
1983
·
C Chvatál
, V Rödl
, et al.
·
Journal of Combinatorial Theory Series B
·
205
Threshold functions for small subgraphs
1981
·
Béla Bollobás
·
Mathematical Proceedings of the Cambridge Philosophical Society
·
182
Spectral extrema of graphs with fixed size: Cycles and complete bipartite graphs
2021
·
Mingqing Zhai
, Huiqiu Lin
, et al.
·
European Journal of Combinatorics
·
129
The Ramsey number for stripes
1975
·
E. J. Cockayne
, P. J. Lorimer
·
Journal of the Australian Mathematical Society
·
104
PDF
Every monotone graph property is testable
2005
·
Noga Alon
, Asaf Shapira
·
ACM Symposium on Theory of Computing (STOC)
·
102
Light subgraphs of graphs embedded in the plane—A survey
2012
·
S. Jendrol’
, H.-J. Voss
·
Discrete Mathematics
·
98
PDF
Sharp thresholds For monotone properties in random geometric graphs
2004
·
Ashish Goel
, Sanatan Rai
, et al.
·
ACM Symposium on Theory of Computing (STOC)
·
98
On Ramsey—Turán type theorems for hypergraphs
1982
·
P. Erdős
, Vera T. Sós
·
COMBINATORICA
·
98
PDF
Every Monotone Graph Property Is Testable
2008
·
Noga Alon
, Asaf Shapira
·
SIAM Journal on Computing
·
93
Spanning Trees in Dense Graphs
2001
·
JÁNOS KOMLÓS
, GÁBOR N. SÁRKÓZY
, et al.
·
Combinatorics Probability Computing
·
91
Embedding Arbitrary Graphs of Maximum Degree Two
1993
·
M. Aigner
, S. Brandt
·
Journal of the London Mathematical Society
·
86
Universal Graphs for Bounded-Degree Trees and Planar Graphs
1989
·
Sandeep N. Bhatt
, F. R. K. Chung
, et al.
·
SIAM Journal on Discrete Mathematics
·
78
Turán′s Extremal Problem in Random Graphs: Forbidding Even Cycles
1995
·
P.E. Haxell
, Y. Kohayakawa
, et al.
·
Journal of Combinatorial Theory Series B
·
72
Preprocessing subgraph and minor problems: When does a small vertex cover help?
2013
·
Fedor V. Fomin
, Bart M.P. Jansen
, et al.
·
Journal of Computer and System Sciences
·
67
PDF
Connected substructure similarity search
2010
·
Haichuan Shang
, Xuemin Lin
, et al.
·
ACM SIGMOD International Conference on Management of Data (SIGMOD)
·
67
On Graphs Which Contain All Sparse Graphs
1982
·
L. Babai
, F.R.K. Chung
, et al.
·
North-Holland mathematics studies
·
67
Subgraphs of graphs, I
1974
·
Paul A. Catlin
·
Discrete Mathematics
·
65
PDF
Tree embeddings
2001
·
P. E. Haxell
·
Journal of Graph Theory
·
63
On graphs which contain all small trees
1978
·
F.R.K Chung
, R.L Graham
·
Journal of Combinatorial Theory Series B
·
62
On a Turán type problem of Erdös
1991
·
Zolt�n F�redi
·
COMBINATORICA
·
60
Universal graphs and induced‐universal graphs
1990
·
Fan R. K. Chung
·
Journal of Graph Theory
·
59
Embedding bounded degree spanning trees in random graphs
2014
·
Montgomery, Richard
·
arXiv (Cornell University)
·
54
PDF
Rainbow spanning structures in graph and hypergraph systems
2023
·
Yangyang Cheng
, Jie Han
, et al.
·
Forum of Mathematics Sigma
·
46
PDF
Graph Kernels: State-of-the-Art and Future Challenges
2020
·
Karsten Borgwardt
, Elisabetta Ghisu
, et al.
·
46
Optimal universal graphs with deterministic embedding
2008
·
Noga Alon
, Michael Capalbo
·
Symposium on Discrete Algorithms
·
46
Show more works
View as search
Works count:
271
Citation count:
3,644
Year
Topic
Type