相关论文: Minors in expanding graphs
We consider random simple temporal graphs in which every edge of the complete graph $K_n$ appears once within the time interval [0,1] independently and uniformly at random. Our main result is a sharp threshold on the size of any maximum…
In this work, we give the sharp upper bound for the number of cliques in graphs with bounded odd circumferences. This generalized Tur\'an-type result is an extension of the celebrated Erd\H{o}s and Gallai theorem and a strengthening of…
We study the maximum number $ex(n,e,H)$ of copies of a graph $H$ in graphs with given number of vertices and edges. We show that for any fixed graph $H$, $ex(n,e,H)$ is asymptotically realized by the quasi-clique provided that the edge…
We prove that, for each circle graph $H$, every graph with sufficiently large rank-width contains a vertex-minor isomorphic to $H$.
We give an $O(n^4)$ algorithm to find a minimum clique cover of a (bull, $C_4$)-free graph, or equivalently, a minimum colouring of a (bull, $2K_2$)-free graph, where $n$ is the number of vertices of the graphs.
A graph H is a vertex-minor of a graph G if it can be reached from G by the successive application of local complementations and vertex deletions. Vertex-minors have been the subject of intense study in graph theory over the last decades…
The theory of dense graph limits comes with a natural sampling process which yields an inhomogeneous variant G(n,W) of the Erdos-Renyi random graph. Here we study the clique number of these random graphs. We establish the concentration of…
The maximum clique problem is a classical NP-complete problem in graph theory and has important applications in many domains. In this paper we show, in a partially non-constructive way, the existence of an exact polynomial-time algorithm…
This article explores a new type of optimal covering of a complete graph by small cliques of different sizes, namely the minimum covering with minimum excess. In particular, the minimum size of a covering by triples and quadruples with…
Andreae (1986) proved that the cop number of connected $H$-minor-free graphs is bounded for every graph $H$. In particular, the cop number is at most $|E(H-h)|$ if $H-h$ contains no isolated vertex, where $h\in V(H)$. The main result of…
Given an infinite word over the alphabet $\{0,1,2,3\}$, we define a class of bipartite hereditary graphs $\mathcal{G}^\alpha$, and show that $\mathcal{G}^\alpha$ has unbounded clique-width unless $\alpha$ contains at most finitely many…
In 2022, Gao, Huo, Liu, and Ma proved that every graph with minimum degree at least $k+1$ contains $k$ admissible cycles, where a set of $k$ cycles is said to be admissible if their lengths form an arithmetic progression with common…
Chen, Faudree, Gould, Jacobson, and Lesniak determined the minimum degree threshold for which a balanced $k$-partite graph has a Hamiltonian cycle. We give an asymptotically tight minimum degree condition for Hamiltonian cycles in arbitrary…
The bandwidth of a graph G is the minimum of the maximum difference between adjacent labels when the vertices have distinct integer labels. We provide a polynomial algorithm to produce an optimal bandwidth labeling for graphs in a special…
We present a new formulation of the maximum clique problem of a graph in complex space. We start observing that the adjacency matrix A of a graph can always be written in the form A = B B where B is a complex, symmetric matrix formed by…
Maximal clique enumeration is a fundamental graph mining task, but its utility is often limited by computational intractability and highly redundant output. To address these challenges, we introduce \emph{$\rho$-dense aggregators}, a novel…
We prove for k at most 10, that every graph of chromatic number k with a unique k-coloring admits a clique minor of order k.
We prove that for all $r\geq2$ and c>0, every graph of order n with at least cn^{r} cliques of order r contains a complete r-partite graph with each part of size $\lfloor c^{r}\log n \rfloor.$ This result implies a concise form of the…
We prove that for every tree $T$ which is not an edge, for almost every graph $G$ which does not contain $T$ as an induced subgraph, $V(G)$ has a partition into $\alpha(T)-1$ parts certifying this fact. Each part induces a graph which is…
A number of famous results about triangle-free graphs determine the maximum chromatic number of graphs of order n with minimum degree greater than n/3. In this note these results are extended to Kr-free graphs.