Related papers: Ordered graphs and large bi-cliques in intersectio…
It was proved by Scott that for every $k\ge2$, there exists a constant $c(k)>0$ such that for every bipartite $n$-vertex graph $G$ without isolated vertices, there exists an induced subgraph $H$ of order at least $c(k)n$ such that…
Let $G$ be a graph and $\mathcal{K}_G$ be the set of all cliques of $G$, then the clique graph of G denoted by $K(G)$ is the graph with vertex set $\mathcal{K}_G$ and two elements $Q_i,Q_j \in \mathcal{K}_G$ form an edge if and only if $Q_i…
For $k\ge 1$, we consider interleaved $k$-tuple colorings of the nodes of a graph, that is, assignments of $k$ distinct natural numbers to each node in such a way that nodes that are connected by an edge receive numbers that are strictly…
Consider a graph $G$ with a long path $P$. When is it the case that $G$ also contains a long induced path? This question has been investigated in general as well as within a number of different graph classes since the 80s. We have recently…
The famous K\H{o}nig-Egerv\'ary theorem is equivalent to the statement that the matching number equals the vertex cover number for every induced subgraph of some graph if and only if that graph is bipartite. Inspired by this result, we…
The bipartite-hole-number of a graph $G$, denoted by $\widetilde{\alpha}(G)$, is the minimum integer $k$ such that there exist positive integers $s$ and $t$ with $s + t = k + 1$, satisfying the property that for any two disjoint sets $A, B…
We consider the problem of clique coloring, that is, coloring the vertices of a given graph such that no (maximal) clique of size at least two is monocolored. It is known that interval graphs are $2$-clique colorable. In this paper we prove…
In any graph, the maximum size of an induced path is bounded by the maximum size of a path. However, in the general case, one cannot find a converse bound, even up to an arbitrary function, as evidenced by the case of cliques. Galvin, Rival…
A graph is an opposition graph, respectively, a coalition graph, if it admits an acyclic orientation which puts the two end-edges of every chordless 4-vertex path in opposition, respectively, in the same direction. Opposition and coalition…
Over all graphs (or unicyclic graphs) of a given order, we characterise those graphs that minimise or maximise the number of connected induced subgraphs. For each of these classes, we find that the graphs that minimise the number of…
We investigate which graphs H have the property that in every graph with bounded clique number and sufficiently large chromatic number, some induced subgraph is isomorphic to a subdivision of H. In an earlier paper, one of us proved that…
We consider the complexity of the recognition problem for two families of combinatorial structures. A graph $G=(V,E)$ is said to be an intersection graph of lines in space if every $v\in V$ can be mapped to a straight line $\ell (v)$ in…
In this paper, we show that for any positive integer $m$ and $k\in [2]$, let $G$ be a $(2m+2k+2)$-connected graph and let $a_1,\ldots , a_m, s, t$ be any distinct vertices of $G$, there are $k$ internally disjoint $s$-$t$ paths $P_1,…
If a graph has no induced subgraph isomorphic to any graph in a finite family $\{H_1,\ldots,H_p\}$, it is said to be $(H_1,\ldots,H_p)$-free. The class of $H$-free graphs has bounded clique-width if and only if $H$ is an induced subgraph of…
A clique colouring of a graph is a colouring of the vertices such that no maximal clique is monochromatic (ignoring isolated vertices). The least number of colours in such a colouring is the clique chromatic number. Given $n$ points $x_1,…
Motivated by its relation to the length of cutting plane proofs for the Maximum Biclique problem, we consider the following communication game on a given graph G, known to both players. Let K be the maximal number of vertices in a complete…
For each m>=1 and k>=2, we construct a graph G=(V,E) with \omega(G)=m such that max_{1\leq i\leq k} \omega(G[V_i])=m for arbitrary partition V=V_1\cup...\cup V_k, where \omega(G) is the clique number of G and G[V_i] is the induced subgraph…
Ore's Theorem states that if $G$ is an $n$-vertex graph and every pair of non-adjacent vertices has degree sum at least $n$, then $G$ is Hamiltonian. A $[3]$-graph is a hypergraph in which every edge contains at most $3$ vertices. In this…
A class of graphs G is chi-bounded if the chromatic number of the graphs in G is bounded by some function of their clique number. We show that the class of intersection graphs of simple x-monotone curves in the plane intersecting a vertical…
The unitary Cayley graph of $\mathbb Z/n\mathbb Z$, denoted $G_{\mathbb Z/n\mathbb Z}$, is the graph with vertices $0,1,\ldots,$ $n-1$ in which two vertices are adjacent if and only if their difference is relatively prime to $n$. These…