منابع مشابه
Excluding hooks and their complements
The celebrated Erdős-Hajnal conjecture states that for every n-vertex undirected graph H there exists ε(H) > 0 such that every graph G that does not contain H as an induced subgraph contains a clique or an independent set of size at least n. A weaker version of the conjecture states that the polynomial-size clique/independent set phenomenon occurs if one excludes both H and its complement H. We...
متن کاملExcluding four-edge paths and their complements
We prove that a graph G contains no induced four-edge path and no induced complement of a four-edge path if and only if G is obtained from five-cycles and split graphs by repeatedly applying the following operations: substitution, split graph unification, and split graph unification in the complement (“split graph unification” is a new class-preserving operation that is introduced in this paper).
متن کاملTopology of Plane Arrangements and Their Complements
This is a glossary of notions and methods related with the topological theory of collections of affine planes, including braid groups, configuration spaces, order complexes, stratified Morse theory, simplicial resolutions, complexes of graphs, Orlik– Solomon rings, Salvetti complex, matroids, Spanier–Whitehead duality, twisted homology groups, monodromy theory and multidimensional hypergeometri...
متن کاملClique Minors in Graphs and Their Complements
A graph H is a minor of a graph G if H can be obtained from a subgraph of G by contracting edges. Let t ≥ 1 be an integer, and let G be a graph on n vertices with no minor isomorphic to Kt+1. Kostochka conjectures that there exists a constant c = c(k) independent of G such that the complement of G has a minor isomorphic to Ks, where s = d2 (1 + 1/t)n − ce. We prove that Kostochka’s conjecture i...
متن کاملMaximum norms of graphs and their complements
Given a graph G; let kGk denote the trace norm of its adjacency matrix, also known as the energy of G: The main result of this paper states that if G is a graph of order n; then kGk + G (n 1) 1 +n ; where G is the complement of G: Equality is possible if and only if G is a strongly regular graph with parameters (n; (n 1) =2; (n 5) =4; (n 1) =4) ; known also as a conference graph. In fact, the a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2018
ISSN: 1077-8926
DOI: 10.37236/6397