On unavoidable‐induced subgraphs in large prime graphs
نویسندگان
چکیده
منابع مشابه
On Unavoidable Induced Subgraphs in Large Prime Graphs
Chudnovsky, Kim, Oum, and Seymour recently established that any prime graph contains one of a short list of induced prime subgraphs [1]. In the present paper we reprove their theorem using many of the same ideas, but with the key model-theoretic ingredient of first determining the so-called amount of stability of the graph. This approach changes the applicable Ramsey theorem, improves the bound...
متن کاملTesting Subgraphs in Large Graphs
Let H be a fixed graph with h vertices, let G be a graph on n vertices and suppose that at least n edges have to be deleted from it to make it H-free. It is known that in this case G contains at least f( ,H)n copies of H . We show that the largest possible function f( ,H) is polynomial in if and only if H is bipartite. This implies that there is a one-sided error property tester for checking H-...
متن کاملDiscovering Large Dense Subgraphs in Massive Graphs
We present a new algorithm for finding large, dense subgraphs in massive graphs. Our algorithm is based on a recursive application of fingerprinting via shingles, and is extremely efficient, capable of handling graphs with tens of billions of edges on a single machine with modest resources. We apply our algorithm to characterize the large, dense subgraphs of a graph showing connections between ...
متن کاملLarge planar subgraphs in dense graphs
We prove sufficient and essentially necessary conditions in terms of the minimum degree for a graph to contain planar subgraphs with many edges. For example, for all positive γ every sufficiently large graph G with minimum degree at least (2/3 + γ)|G| contains a triangulation as a spanning subgraph, whereas this need not be the case when the minimum degree is less than 2|G|/3.
متن کاملA distance measure for large graphs based on prime graphs
Graphs are universal modeling tools. They are used to represent objects and their relationships in almost all domains: they are used to represent DNA, images, videos, social networks, XML documents, etc. When objects are represented by graphs, the problem of their comparison is a problem of comparing graphs. Comparing objects is a key task in our daily life. It is the core of a search engine, t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Theory
سال: 2017
ISSN: 0364-9024,1097-0118
DOI: 10.1002/jgt.22209