相关论文: A note on Reed's conjecture

The irregularity strength of a graph $G$, $s(G)$, is the least $k$ admitting a $\{1,2,\ldots,k\}$-weighting of the edges of $G$ assuring distinct weighted degrees of all vertices, or equivalently the least possible maximal edge multiplicity…

The well-known 1-2-3 Conjecture asserts that the edges of every graph without isolated edges can be weighted with $1$, $2$ and $3$ so that adjacent vertices receive distinct weighted degrees. This is open in general, while it is known to be…

For a graph $G$, let $f_o(G)$ denote the maximum order of an induced subgraph of $G$ all of whose vertices have odd degree, and let $\chi(G)$ denote the chromatic number of $G$. Scott (CPC, 1992) proved that $f_o(G) \ge |V(G)|/(2\chi(G))$…

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)$…

We prove that $\chi(G) \leq \max {\omega(G), \Delta_2(G), (5/6)(\Delta(G) + 1)}$ for every graph $G$ with $\Delta(G) \geq 3$. Here $\Delta_2$ is the parameter introduced by Stacho that gives the largest degree that a vertex $v$ can have…

For a graph $G$, let $\lambda_2(G)$ denote its second smallest Laplacian eigenvalue. It was conjectured that $\lambda_2(G) + \lambda_2(\overline{G}) \geq 1$, where $\bar{G}$ is the complement of $G$. Here, we prove this conjecture in the…

Let $K$ be a complete graph of order $n$. For $d\in (0,1)$, let $c$ be a $\pm 1$-edge labeling of $K$ such that there are $d{n\choose 2}$ edges with label $+1$, and let $G$ be a spanning subgraph of $K$ of maximum degree at most $\Delta$.…

The distinguishing index of a simple graph $G$, denoted by $D'(G)$, is the least number of labels in an edge labeling of $G$ not preserved by any non-trivial automorphism. It was conjectured by Pil\'sniak (2015) that for any 2-connected…

In 2011, the second author conjectured that every line graph $G$ satisfies $\chi(G)\le \max\{\omega(G),\frac{5\Delta(G)+8}{6}\}$. This conjecture is best possible, as shown by replacing each edge in a 5-cycle by $k$ parallel edges, and…

Let ${\rm dim}(G)$ and $D(G)$ respectively denote the metric dimension and the distinguishing number of a graph $G$. It is proved that $D(G) \le {\rm dim}(G)+1$ holds for every connected graph $G$. Among trees, exactly paths and stars…

The inertia of a graph $G$ is $\operatorname{In}(G)=(n^+(G),n^0(G),n^-(G))$, where $n^+(G),\, n^0(G),\, n^-(G)$ are the numbers of positive, zero and negative eigenvalues of the adjacency matrix of $G$, respectively, counted with…

Given a simple graph $G$, the {\it irregularity strength} of $G$, denoted $s(G)$, is the least positive integer $k$ such that there is a weight assignment on edges $f: E(G) \to \{1,2,\dots, k\}$ for which each vertex weight $f^V(v):=…

Let $G$ be a graph, $\chi(G)$ be the minimal number of colors which can be assigned to the vertices of $G$ in such a way that every two adjacent vertices have different colors and $\omega(G)$ to be the least upper bound of the size of the…

Let $G$ be a simple graph of order $n$ with degree sequence $(d)=(d_1,d_2,\ldots,d_n)$ and conjugate degree sequence $(d^*)=(d_1^*,d_2^*,\ldots,d_n^*)$. In \cite{AkbariGhorbaniKoolenObudi2010,DasMojallalGutman2017} it was proven that…

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…

Woodall (and Seymour independently) in 2001 proposed a conjecture that every graph $G$ contains every complete bipartite graph on $\chi(G)$ vertices as a minor, where $\chi(G)$ is the chromatic number of $G$. In this paper, we prove that…

Let $G$ be a simple graph. Denote by $n$, $\Delta(G)$ and $\chi' (G)$ be the order, the maximum degree and the chromatic index of $G$, respectively. We call $G$ \emph{overfull} if $|E(G)|/\lfloor n/2\rfloor > \Delta(G)$, and {\it critical}…

For a graph $G$, let $G^2$ be the graph with the same vertex set as $G$ and $xy \in E(G^2)$ when $x \neq y$ and $d_G(x,y) \leq 2$. Bonamy, L\'ev\^{e}que, and Pinlou conjectured that if $mad (G) < 4 - \frac{2}{c+1}$ and $\Delta(G)$ is large,…

Berge Conjecture states that every bridgeless cubic graph has 5 perfect matchings such that each edge is contained in at least one of them. In this paper, we show that Berge Conjecture holds for two classes of cubic graphs, cubic graphs…

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…