Pure pairs. III. Sparse graphs with no polynomial‐sized anticomplete pairs
نویسندگان
چکیده
منابع مشابه
Sparse graphs with no polynomial-sized anticomplete pairs
A graph is H-free if it has no induced subgraph isomorphic to H. An old conjecture of Conlon, Sudakov and the second author asserts that: • For every graph H, there exists ε > 0 such that in every H-free graph with n > 1 vertices there are two disjoint sets of vertices, of sizes at least εn and εn, complete or anticomplete to each other. This is equivalent to: • The ‘sparse linear conjecture’: ...
متن کاملSparse graphs without linear anticomplete pairs
We prove for every graph H there exists > 0 such that, for every graph G with |G| ≥ 2, if no induced subgraph of G is a subdivision of H, then either some vertex of G has at least |G| neighbours, or there are two disjoint sets A,B ⊆ V (G) with |A|, |B| ≥ |G| such that no edge joins A and B. It follows that for every graph H, there exists c > 0 such that for every graph G, if no induced subgraph...
متن کاملTrees and linear anticomplete pairs
We prove a conjecture of Liebenau, Pilipczuk, and the last two authors [8], that for every forest H there exists ε > 0, such that if G has n ≥ 2 vertices and does not contain H as an induced subgraph, then either • some vertex has degree at most εn; or • there are two disjoint sets A,B ⊆ V (G) with |A|, |B| ≥ εn, such that there are no edges between A,B. (It is known that no graphs H except for...
متن کاملRegular pairs in sparse random graphs I
We consider bipartite subgraphs of sparse random graphs that are regular in the sense of Szemerédi and, among other things, show that they must satisfy a certain local pseudorandom property. This property and its consequences turn out to be useful when considering embedding problems in subgraphs of sparse random graphs.
متن کاملAll-Pairs Shortest Paths Algorithm for High-dimensional Sparse Graphs
Here the All-pairs shortest path problem on weighted undirected sparse graphs is being considered. For the problem considered, we propose " disassembly and assembly of a graph " algorithm which uses a solution of the problem on a small-dimensional graph to obtain the solution for the given graph. The proposed algorithm has been compared to one of the fastest classic algorithms on data from an o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Theory
سال: 2020
ISSN: 0364-9024,1097-0118
DOI: 10.1002/jgt.22556