相关论文: Dense Matchings of Linear Size in Graphs with Inde…

A matching $M$ in a graph $G$ is {\em connected} if $G$ has an edge linking each pair of edges in $M$. The problem to find large connected matchings in graphs $G$ with $\alpha(G)=2$ is closely related to Hadwiger's conjecture for graphs…

For a graph G, let h(G) denote the largest k such that G has k pairwise disjoint pairwise adjacent connected nonempty subgraphs, and let s(G) denote the largest k such that G has k pairwise disjoint pairwise adjacent connected subgraphs of…

In 2010, Mkrtchyan, Petrosyan and Vardanyan proved that every graph $G$ with $2\leq \delta(G)\leq \Delta(G)\leq 3$ contains a maximum matching whose unsaturated vertices do not have a common neighbor, where $\Delta(G)$ and $\delta(G)$…

Hadwiger's Conjecture states that every graph with chromatic number $k$ contains a complete graph on $k$ vertices as a minor. This conjecture is a tremendous strengthening of the Four-Colour Theorem and is regarded as one of the most…

For $i=2,3$ and a cubic graph $G$ let $\nu_{i}(G)$ denote the maximum number of edges that can be covered by $i$ matchings. We show that $\nu_{2}(G)\geq {4/5}| V(G)| $ and $\nu_{3}(G)\geq {7/6}| V(G)| $. Moreover, it turns out that…

An equivalence graph is a disjoint union of cliques, and the equivalence number $\mathit{eq}(G)$ of a graph $G$ is the minimum number of equivalence subgraphs needed to cover the edges of $G$. We consider the equivalence number of a line…

It was conjectured by Mkrtchyan, Petrosyan, and Vardanyan that every graph $G$ with $\Delta(G)-\delta(G) \le 1$ has a maximum matching $M$ such that any two $M$-unsaturated vertices do not share a neighbor. In this note, we confirm the…

Let $k \geq 3$. We prove the following three bounds for the matching number, $\alpha'(G)$, of a graph, $G$, of order $n$ size $m$ and maximum degree at most $k$. If $k$ is odd, then $\alpha'(G) \ge \left( \frac{k-1}{k(k^2 - 3)} \right) n \,…

For $k \geq 1$ and a graph $G$ let $\nu_k(G)$ denote the size of a maximum $k$-edge-colorable subgraph of $G$. Mkrtchyan, Petrosyan and Vardanyan proved that $\nu_2(G)\geq \frac45\cdot |V(G)|$, $\nu_3(G)\geq \frac76\cdot |V(G)|$ for any…

A graph $G$ is $m$-joined if there is an edge between every two disjoint $m$-sets of vertices. In this paper, we prove that for any $\varepsilon>0$ and sufficiently large $m, n\in \mathbb{N}$ with $m \le n^{1-\varepsilon}$, every $n$-vertex…

For a graph $G=(V,E)$, let $bc(G)$ denote the minimum number of pairwise edge disjoint complete bipartite subgraphs of $G$ so that each edge of $G$ belongs to exactly one of them. It is easy to see that for every graph $G$, $bc(G) \leq n…

We prove that $\frac{7}{4}\alpha(G)+\beta(G)\geq n(G)$ and $\alpha(G)+\frac{3}{2}\beta(G)\geq n(G)$ for every triangle-free graph $G$ with maximum degree at most $4$, where $\alpha(G)$ is the independence number and $\beta(G)$ is the…

For a graph $G$ define the parameters $\ell(G)$ and $L(G)$ as the minimum and maximum value of $\nu(G\backslash F)$, where $F$ is a maximum matching of $G$ and $\nu(G)$ is the matching number of $G$. In this paper, we show that there is a…

Let $G$ be a connected $d$-regular graph of order $n$, where $d\geq3$. Let $\lambda_{2}(G)$ be the second largest eigenvalue of $G$. For even $n$, we show that $G$ contains $\left\lfloor\frac{2}{3}(d-\lambda_{2}(G))\right\rfloor$…

For a graph G and an integer t we let mcc_t(G) be the smallest m such that there exists a coloring of the vertices of G by t colors with no monochromatic connected subgraph having more than m vertices. Let F be any nontrivial minor-closed…

The Hadwiger number h(G) of a graph G is the maximum size of a complete minor of G. Hadwiger's Conjecture states that h(G) >= \chi(G). Since \chi(G) \alpha(G) >= |V(G)|, Hadwiger's Conjecture implies that \alpha(G) h(G) >= |V(G)|. We show…

We will show that for $\alpha>0$ there is $n_0$ such that if $G$ is a graph on $n\geq n_0$ vertices such that $\alpha n< \delta(G)< (n-1)/2$, then for every $n_1+n_2+\cdots +n_l= \delta(G)$, $G$ contains a disjoint union of…

Let $G$ be a graph with an adjacent matrix $A(G)$. The multiplicity of an arbitrary eigenvalue $\lambda$ of $A(G)$ is denoted by $m_\lambda(G)$. In \cite{Wong}, the author apply the Pater-Wiener Theorem to prove that if the diameter of $T$…

In this paper we consider the cop number of graphs with no, or few, short cycles. We show that when $G$ is graph of girth $g$ and the minimum degree $\delta \geq 2$, then $c(G) = O(n\log(n)(\delta-1)^{-\lfloor \frac{g+1}{4} \rfloor})$ as a…

A bisection of a graph is a bipartition of its vertex set such that the two resulting parts differ in size by at most 1, and its size is the number of edges that connect vertices in the two parts. The perfect matching condition and…