相关论文: The Burning Number Conjecture Holds Asymptotically

The burnt pancake graph, denoted by $\mathbb{BP}_n$, is formed by connecting signed permutations via prefix reversals. Here, we discuss some spectral properties of $\mathbb{BP}_n$. More precisely, we prove that the adjacency spectrum of…

Let $G$ be a graph without isolated vertices and let $\alpha(G)$ be its stability number and $\tau(G)$ its covering number. The {\it $\alpha_{v}$-cover} number of a graph, denoted by $\alpha_{v}(G)$, is the maximum natural number $m$ such…

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…

An edge-coloured graph $G$ is called $properly$ $connected$ if every two vertices are connected by a proper path. The $proper$ $connection$ $number$ of a connected graph $G$, denoted by $pc(G)$, is the smallest number of colours that are…

A configuration of pebbles on the vertices of a graph is solvable if one can place a pebble on any given root vertex via a sequence of pebbling steps. The pebbling number of a graph G is the minimum number pi(G) so that every configuration…

Let $G = (V,E)$ be a graph, and for each $e \in E(G)$, let $L_e$ be a list of real numbers. Let $w:E(G) \to \cup_{e \in E(G)}L_e$ be an edge weighting function such that $w(e) \in L_e$ for each $e \in E(G)$, and let $c_w$ be the vertex…

Let $G$ be a simple graph with maximum degree $\Delta(G)$. A subgraph $H$ of $G$ is overfull if $|E(H)|>\Delta(G)\lfloor |V(H)|/2 \rfloor$. Chetwynd and Hilton in 1985 conjectured that a graph $G$ with $\Delta(G)>|V(G)|/3$ has chromatic…

An acyclic edge coloring of a graph $G$ is a proper edge coloring such that no bichromatic cycles are produced. The acyclic edge coloring conjecture by Fiam{\v{c}}ik (1978) and Alon, Sudakov and Zaks (2001) states that every simple graph…

The biclique partition number of a graph \(G\), denoted \( \operatorname{bp}(G)\), is the minimum number of biclique subgraphs needed to partition the edge set of $G$. Lyu and Hicks \cite{lyu2023finding} posed the open problem of whether \(…

The isoperimetric constant of a graph $G$ on $n$ vertices, $i(G)$, is the minimum of $\frac{|\partial S|}{|S|}$, taken over all nonempty subsets $S\subset V(G)$ of size at most $n/2$, where $\partial S$ denotes the set of edges with…

We study a two-person game played on graphs based on the widely studied chip-firing game. Players Max and Min alternately place chips on the vertices of a graph. When a vertex accumulates as many chips as its degree, it fires, sending one…

Given a graph $G$, its Ramsey number $r(G)$ is the minimum $N$ so that every two-coloring of $E(K_N)$ contains a monochromatic copy of $G$. It was conjectured by Conlon, Fox, and Sudakov that if one deletes a single vertex from $G$, the…

For given graphs G1 and G2 the Ramsey number R(G1,G2), is the smallest positive integer n such that each blue-red edge coloring of the complete graph Kn contains a blue copy of G1 or a red copy of G2. In 1983, Erdos conjectured that there…

The bend-number b(G) of a graph G is the minimum k such that G may be represented as the edge intersection graph of a set of grid paths with at most k bends. We confirm a conjecture of Biedl and Stern showing that the maximum bend-number of…

For a graph $G$, denote by $t(G)$ (resp. $b(G)$) the maximum size of a triangle-free (resp. bipartite) subgraph of $G$. Of course $t(G) \geq b(G)$ for any $G$, and a classic result of Mantel from 1907 (the first case of Tur\'an's Theorem)…

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…

We show that if a graph $G$ with $n \geq 3$ vertices can be drawn in the plane such that each of its edges is involved in at most four crossings, then $G$ has at most $6n-12$ edges. This settles a conjecture of Pach, Radoi\v{c}i\'{c},…

An incidence in a graph $G$ is a pair $(v,e)$ where $v$ is a vertex of $G$ and $e$ is an edge of $G$ incident to $v$. Two incidences $(v,e)$ and $(u,f)$ are adjacent if at least one of the following holds: $(a)$ $v = u$, $(b)$ $e = f$, or…

For a given number of colours, $s$, the guessing number of a graph is the base $s$ logarithm of the size of the largest family of colourings of the vertex set of the graph such that the colour of each vertex can be determined from the…

Consider a distribution of pebbles on a connected graph $G$. A pebbling move removes two pebbles from a vertex and places one to an adjacent vertex. A vertex is reachable under a pebbling distribution if it has a pebble after the…