Related papers: Rainbow Saturation
The concept of rainbow disconnection number of graphs was introduced by Chartrand et al. in 2018. Inspired by this concept, we put forward the concepts of rainbow vertex-disconnection and proper disconnection in graphs. In this paper, we…
Given a family of graphs $\mathcal{F}$, a graph $G$ is $\mathcal{F}$-saturated if it is $\mathcal{F}$-free but the addition of any missing edge creates a copy of some $F \in \mathcal{F}$. The study of the minimum number of edges in…
We address a problem which is a generalization of Tur\'an-type problems recently introduced by Imolay, Karl, Nagy and V\'ali. Let $F$ be a fixed graph and let $G$ be the union of $k$ edge-disjoint copies of $F$, namely $G =…
The Ramsey multiplicity constant of a graph $H$ is the minimum proportion of copies of $H$ in the complete graph which are monochromatic under an edge-coloring of $K_n$ as $n$ goes to infinity. Graphs for which this minimum is…
For a graph $G$, Chartrand et al. defined the rainbow connection number $rc(G)$ and the strong rainbow connection number $src(G)$ in "G. Charand, G.L. John, K.A. Mckeon, P. Zhang, Rainbow connection in graphs, Mathematica Bohemica,…
In this paper, we introduce the notion of the rainbow neighbourhood and a related graph parameter namely, the rainbow neighbourhood number of a graph $G$. We report on preliminary results thereof. We also establish a necessary and…
Graham, R\"odl, and Ruci\'nski originally posed the problem of determining the minimum number of monochromatic Schur triples that must appear in any 2-coloring of the first $n$ integers. This question was subsequently resolved independently…
We prove several results on approximate decompositions of edge-coloured quasirandom graphs into rainbow spanning structures. More precisely, we say that an edge-colouring of a graph is locally $\ell$-bounded if no vertex is incident to more…
A graph $G$ is $H$-saturated if it contains no $H$ as a subgraph, but does contain $H$ after the addition of any edge in the complement of $G$. The saturation number, $sat (n, H)$, is the minimum number of edges of a graph in the set of all…
A graph is color-critical if it contains an edge whose deletion reduces its chromatic number. This class of graphs, including cliques and odd cycles, plays a central role in extremal graph theory. In this paper, following an influential…
The oriented Tur\'{a}n number of a given oriented graph $\overrightarrow{F}$, denoted by $\exo(n,\overrightarrow{F})$, is the largest number of arcs in $n$-vertex $\overrightarrow{F}$-free oriented graphs. This parameter could be seen as a…
A fundamental result in extremal graph theory is attributed to Mantel's theorem, which states that every graph on $n$ vertices with more than $\lfloor n^2/4 \rfloor$ edges must contain a triangle. Lov\'{a}sz and Simonovits (1975) provided a…
Various results ensure the existence of large complete bipartite graphs in properly colored graphs when some condition related to a topological lower bound on the chromatic number is satisfied. We generalize three theorems of this kind,…
A {\it simple $k$-coloring} of a multigraph $G$ is a decomposition of the edge multiset as a disjoint sum of $k$ simple graphs which are referred as colors. A subgraph $H$ of a multigraph $G$ is called {\it multicolored} if its edges…
A rainbow $q$-coloring of a $k$-uniform hypergraph is a $q$-coloring of the vertex set such that every hyperedge contains all $q$ colors. We prove that given a rainbow $(k - 2\lfloor \sqrt{k}\rfloor)$-colorable $k$-uniform hypergraph, it is…
Given a positive integer $n$ and an $r$-uniform hypergraph (or $r$-graph for short) $F$, the Turan number $ex(n,F)$ of $F$ is the maximum number of edges in an $r$-graph on $n$ vertices that does not contain $F$ as a subgraph. The extension…
We consider unavoidable chromatic patterns in $2$-colorings of the edges of the complete graph. Several such problems are explored being a junction point between Ramsey theory, extremal graph theory (Tur\'an type problems), zero-sum Ramsey…
For a given class $\mathcal{C}$ of graphs and given integers $m \leq n$, let $f_\mathcal{C}(n,m)$ be the minimal number $k$ such that every $k$ independent $n$-sets in any graph belonging to $\mathcal{C}$ have a (possibly partial) rainbow…
The saturation number $\operatorname{sat}(n, H)$ of a graph $H$ and positive integer $n$ is the minimum size of a graph of order $n$ which does not contain a subgraph isomorphic to $H$ but to which the addition of any edge creates such a…
There has been extensive studies on the following question: given $k$ graphs $G_1,\dots, G_k$ over a common vertex set of size $n$, what conditions on $G_i$ ensures a `colorful' copy of $H$, i.e., a copy of $H$ containing at most one edge…