arXiv subjects

Jakub Przybyło

Publications and source records attributed to Jakub Przybyło.

52 records · Page 3Linked to original sources

arXiv2017

Distant total sum distinguishing index of graphs

Let $c:V\cup E\to\{1,2,\ldots,k\}$ be a proper total colouring of a graph $G=(V,E)$ with maximum degree $Δ$. We say vertices $u,v\in V$ are sum distinguished if $c(u)+\sum_{e\ni u}c(e)\neq c(v)+\sum_{e\ni v}c(e)$. By $χ"_{Σ,r}(G)$ we denote the least integer $k$ admitting such a colouring $c$ for which every $u,v\in V$, $u\neq v$, at distance at most $r$ from each other are sum distinguished in $G$. For every positive integer $r$ an infinite family of examples is known with $χ"_{Σ,r}(G)=Ω(Δ^{r-1})$. In this paper we prove that $χ"_{Σ,r}(G)\leq (2+o(1))Δ^{r-1}$ for every integer $r\geq 3$ and each graph $G$, while $χ"_{Σ,2}(G)\leq (18+o(1))Δ$.

math.CO↗

arXiv2017

Distant sum distinguishing index of graphs with bounded minimum degree

For any graph $G=(V,E)$ with maximum degree $Δ$ and without isolated edges, and a positive integer $r$, by $χ'_{Σ,r}(G)$ we denote the $r$-distant sum distinguishing index of $G$. This is the least integer $k$ for which a proper edge colouring $c:E\to\{1,2,\ldots,k\}$ exists such that $\sum_{e\ni u}c(e)\neq \sum_{e\ni v}c(e)$ for every pair of distinct vertices $u,v$ at distance at most $r$ in $G$. It was conjectured that $χ'_{Σ,r}(G)\leq (1+o(1))Δ^{r-1}$ for every $r\geq 3$. Thus far it has been in particular proved that $χ'_{Σ,r}(G)\leq 6Δ^{r-1}$ if $r\geq 4$. Combining probabilistic and constructive approach, we show that this can be improved to $χ'_{Σ,r}(G)\leq (4+o(1))Δ^{r-1}$ if the minimum degree of $G$ equals at least $\ln^8Δ$.

math.CO↗

arXiv2017

Distant sum distinguishing index of graphs

Consider a positive integer $r$ and a graph $G=(V,E)$ with maximum degree $Δ$ and without isolated edges. The least $k$ so that a proper edge colouring $c:E\to\{1,2,\ldots,k\}$ exists such that $\sum_{e\ni u}c(e)\neq \sum_{e\ni v}c(e)$ for every pair of distinct vertices $u,v$ at distance at most $r$ in $G$ is denoted by $χ'_{Σ,r}(G)$. For $r=1$ it has been proved that $χ'_{Σ,1}(G)=(1+o(1))Δ$. For any $r\geq 2$ in turn an infinite family of graphs is known with $χ'_{Σ,r}(G)=Ω(Δ^{r-1})$. We prove that on the other hand, $χ'_{Σ,r}(G)=O(Δ^{r-1})$ for $r\geq 2$. In particular we show that $χ'_{Σ,r}(G)\leq 6Δ^{r-1}$ if $r\geq 4$.

math.CO↗

arXiv2017

Distant irregularity strength of graphs with bounded minimum degree

Consider a graph $G=(V,E)$ without isolated edges and with maximum degree $Δ$. Given a colouring $c:E\to\{1,2,\ldots,k\}$, the weighted degree of a vertex $v\in V$ is the sum of its incident colours, i.e., $\sum_{e\ni v}c(e)$. For any integer $r\geq 2$, the least $k$ admitting the existence of such $c$ attributing distinct weighted degrees to any two different vertices at distance at most $r$ in $G$ is called the $r$-distant irregularity strength of $G$ and denoted by $s_r(G)$. This graph invariant provides a natural link between the well known 1--2--3 Conjecture and irregularity strength of graphs. In this paper we apply the probabilistic method in order to prove an upper bound $s_r(G)\leq (4+o(1))Δ^{r-1}$ for graphs with minimum degree $δ\geq \ln^8Δ$, improving thus far best upper bound $s_r(G)\leq 6Δ^{r-1}$.

math.CO↗

arXiv2017

Distant total irregularity strength of graphs via random vertex ordering

Let $c:V\cup E\to\{1,2,\ldots,k\}$ be a (not necessarily proper) total colouring of a graph $G=(V,E)$ with maximum degree $Δ$. Two vertices $u,v\in V$ are sum distinguished if they differ with respect to sums of their incident colours, i.e. $c(u)+\sum_{e\ni u}c(e)\neq c(v)+\sum_{e\ni v}c(e)$. The least integer $k$ admitting such colouring $c$ under which every $u,v\in V$ at distance $1\leq d(u,v)\leq r$ in $G$ are sum distinguished is denoted by ${\rm ts}_r(G)$. Such graph invariants link the concept of the total vertex irregularity strength of graphs with so called 1-2-Conjecture, whose concern is the case of $r=1$. Within this paper we combine probabilistic approach with purely combinatorial one in order to prove that ${\rm ts}_r(G)\leq (2+o(1))Δ^{r-1}$ for every integer $r\geq 2$ and each graph $G$, thus improving the previously best result: ${\rm ts}_r(G)\leq 3Δ^{r-1}$.

math.CO↗

arXiv2017

A note on asymptotically optimal neighbour sum distinguishing colourings

The least $k$ admitting a proper edge colouring $c:E\to\{1,2,\ldots,k\}$ of a graph $G=(V,E)$ without isolated edges such that $\sum_{e\ni u}c(e)\neq \sum_{e\ni v}c(e)$ for every $uv\in E$ is denoted by $χ'_Σ(G)$. It has been conjectured that $χ'_Σ(G)\leq Δ+ 2$ for every connected graph of order at least three different from the cycle $C_5$, where $Δ$ is the maximum degree of $G$. It is known that $χ'_Σ(G) = Δ+ O(Δ^\frac{5}{6}\ln^\frac{1}{6}Δ)$ for a graph $G$ without isolated edges. We improve this upper bound to $χ'_Σ(G) = Δ+ O(Δ^\frac{1}{2})$ using a simpler approach involving a combinatorial algorithm enhanced by the probabilistic method. The same upper bound is provided for the total version of this problem as well.

math.CO↗

arXiv2016

New bounds for locally irregular chromatic index of bipartite and subcubic graphs

A graph is \textit{locally irregular} if the neighbors of every vertex $v$ have degrees distinct from the degree of $v$. \textit{locally irregular edge-coloring} of a graph $G$ is an (improper) edge-coloring such that the graph induced on the edges of any color class is locally irregular. It is conjectured that $3$ colors suffice for a locally irregular edge-coloring. Recently, Bensmail et al. (Bensmail, Merker, Thomassen: Decomposing graphs into a constant number of locally irregular subgraphs, {\em European J. Combin.}, 60:124--134, 2017) settled the first constant upper bound for the problem to $328$ colors. In this paper, using a combination of existing results, we present an improvement of the bounds for bipartite graphs and general graphs, setting the best upper bounds to $7$ and $220$, respectively. In addition, we also prove that $4$ colors suffice for locally irregular edge-coloring of any subcubic graph.

math.CO↗

arXiv2016

Asymptotically optimal neighbor sum distinguishing total colorings of graphs

Given a proper total $k$-coloring $c:V(G)\cup E(G)\to\{1,2,\ldots,k\}$ of a graph $G$, we define the value of a vertex $v$ to be $c(v) + \sum_{uv \in E(G)} c(uv)$. The smallest integer $k$ such that $G$ has a proper total $k$-coloring whose values form a proper coloring is the neighbor sum distinguishing total chromatic number of $G$, $χ"_Σ(G)$. Pilśniak and Woźniak (2013) conjectured that $χ"_Σ(G)\leq Δ(G)+3$ for any simple graph with maximum degree $Δ(G)$. In this paper, we prove this bound to be asymptotically correct by showing that $χ"_Σ(G)\leq Δ(G)(1+o(1))$. The main idea of our argument relies on Przybyło's proof (2014) regarding neighbor sum distinguishing edge-colorings.

math.CO↗

arXiv2015

On the neighbour sum distinguishing index of graphs with bounded maximum average degree

A proper edge $k$-colouring of a graph $G=(V,E)$ is an assignment $c:E\to \{1,2,\ldots,k\}$ of colours to the edges of the graph such that no two adjacent edges are associated with the same colour. A neighbour sum distinguishing edge $k$-colouring, or nsd $k$-colouring for short, is a proper edge $k$-colouring such that $\sum_{e\ni u}c(e)\neq \sum_{e\ni v}c(e)$ for every edge $uv$ of $G$. We denote by $χ'_{\sum}(G)$ the neighbour sum distinguishing index of $G$, which is the least integer $k$ such that an nsd $k$-colouring of $G$ exists. By definition at least maximum degree, $Δ(G)$ colours are needed for this goal. In this paper we prove that $χ'_Σ(G) \leq Δ(G)+1$ for any graph $G$ without isolated edges and with ${\rm mad}(G)<3$, $Δ(G) \geq 6$.

math.CO↗

arXiv2015

Distant set distinguishing total colourings of graphs

The Total Colouring Conjecture suggests that $Δ+3$ colours ought to suffice in order to provide a proper total colouring of every graph $G$ with maximum degree $Δ$. Thus far this has been confirmed up to an additive constant factor, and the same holds even if one additionally requires every pair of neighbours in $G$ to differ with respect to the sets of their incident colours, so called pallets. Within this paper we conjecture that an upper bound of the form $Δ+const.$ still remains valid even after extending the distinction requirement to pallets associated with vertices at distance at most $r$, if only $G$ has minimum degree $δ$ larger than a constant dependent on $r$. We prove that such assumption on $δ$ is then unavoidable and exploit the probabilistic method in order to provide two supporting results for the conjecture. Namely, we prove the upper bound $(1+o(1))Δ$ for every $r$, and show that the conjecture holds if $δ\geq \varepsilonΔ$ for any fixed $ε\in(0,1]$ and $r$, i.e., in particular for regular graphs.

math.CO↗

arXiv2015

Distant set distinguishing edge colourings of graphs

We consider the following extension of the concept of adjacent strong edge colourings of graphs without isolated edges. Two distinct vertices which are at distant at most $r$ in a graph are called $r$-adjacent. The least number of colours in a proper edge colouring of a graph $G$ such that the sets of colours met by any $r$-adjacent vertices in $G$ are distinct is called the $r$-adjacent strong chromatic index of $G$ and denoted by $χ'_{a,r}(G)$. It has been conjectured that $χ'_{a,1}(G)\leqΔ+2$ if $G$ is connected of maximum degree $Δ$ and non-isomorphic to $C_5$, while Hatami proved that there is a constant $C$, $C\leq 300$, such that $χ'_{a,1}(G)\leqΔ+C$ if $Δ>10^{20}$ [J. Combin. Theory Ser. B 95 (2005) 246--256]. We conjecture that a similar statement should hold for any $r$, i.e., that for each positive integer $r$ there exist constants $δ_0$ and $C$ such that $χ'_{a,r}(G) \leq Δ+C$ for every graph without an isolated edge and with minimum degree $δ\geq δ_0$, and argue that a lower bound on $δ$ is unavoidable in such a case (for $r>2$). Using the probabilistic method we prove such upper bound to hold for graphs with $δ\geq εΔ$, for every $r$ and any fixed $\varepsilon\in(0,1]$, i.e., in particular for regular graphs. We also support the conjecture by proving an upper bound $χ'_{a,r}(G) \leq (1+o(1))Δ$ for graphs with $δ\geq r+2$.

math.CO↗

arXiv2015

Asymptotically optimal neighbour sum distinguishing total colourings of graphs

Consider a simple graph $G=(V,E)$ of maximum degree $Δ$ and its proper total colouring $c$ with the elements of the set $\{1,2,\ldots,k\}$. The colouring $c$ is said to be \emph{neighbour sum distinguishing} if for every pair of adjacent vertices $u$, $v$, we have $c(u)+\sum_{e\ni u}c(e)\neq c(v)+\sum_{e\ni v}c(e)$. The least integer $k$ for which it exists is denoted by $χ"_{\sum}(G)$, hence $χ"_{\sum}(G) \geq Δ+1$. On the other hand, it has been daringly conjectured that just one more label than presumed in the famous Total Colouring Conjecture suffices to construct such total colouring $c$, i.e., that $χ"_{\sum}(G) \leq Δ+3$ for all graphs. We support this inequality by proving its asymptotic version, $χ"_{\sum}(G) \leq (1+o(1))Δ$. The major part of the construction confirming this relays on a random assignment of colours, where the choice for every edge is biased by so called attractors, randomly assigned to the vertices, and the probabilistic result of Molloy and Reed on the Total Colouring Conjecture itself.

math.CO↗

arXiv2015

On decomposing graphs of large minimum degree into locally irregular subgraphs

A \emph{locally irregular graph} is a graph whose adjacent vertices have distinct degrees. We say that a graph $G$ can be decomposed into $k$ locally irregular subgraphs if its edge set may be partitioned into $k$ subsets each of which induces a locally irregular subgraph in $G$. It has been conjectured that apart from the family of exceptions which admit no such decompositions, i.e., odd paths, odd cycles and a special class of graphs of maximum degree $3$, every connected graph can be decomposed into $3$ locally irregular subgraphs. Using a combination of a probabilistic approach and some known theorems on degree constrained subgraphs of a given graph, we prove this to hold for graphs of sufficiently large minimum degree, $δ(G)\geq 10^{10}$. This problem is strongly related to edge colourings distinguishing neighbours by the pallets of their incident colours and to 1-2-3 Conjecture. In particular, the contribution of this paper constitutes a strengthening of a result of Addario-Berry, Aldred, Dalal and Reed [J. Combin. Theory Ser. B 94 (2005) 237-244].

math.CO↗

arXiv2015

On an extremal problem in the class of 1-planar graphs

A graph $G=(V,E)$ is called 1-planar if it admits a drawing in the plane such that each edge is crossed at most once. In this paper, we study bipartite $1$-planar graphs with prescribed numbers of vertices in partite sets. Bipartite 1-planar graphs are known to have at most $3n-8$ edges, where $n$ denotes the order of a graph. We show that maximal-size bipartite $1$-planar graphs which are almost balanced have not significantly fewer edges than indicated by this upper bound, while the same is not true for unbalanced ones. We prove that maximal possible sizes of bipartite $1$-planar graphs whose one partite set is much smaller than the other one tends towards $2n$ rather than $3n$. In particular, we prove that if the size of the smaller partite set is sublinear in $n$, then $|E|=(2+o(1))n$, while the same is not true otherwise.

math.CO↗

arXiv2013

On the facial Thue choice number of plane graphs via entropy compression method

Let $G$ be a plane graph. A vertex-colouring $φ$ of $G$ is called {\em facial non-repetitive} if for no sequence $r_1 r_2 \dots r_{2n}$, $n\geq 1$, of consecutive vertex colours of any facial path it holds $r_i=r_{n+i}$ for all $i=1,2,\dots,n$. A plane graph $G$ is {\em facial non-repetitively $l$-choosable} if for every list assignment $L:V\rightarrow 2\sp{\mathbb{N}}$ with minimum list size at least $l$ there is a facial non-repetitive vertex-colouring $φ$ with colours from the associated lists. The {\em facial Thue choice number}, $π_{fl}(G)$, of a plane graph $G$ is the minimum number $l$ such that $G$ is facial non-repetitively $l$-choosable. %In this article we We use the so-called entropy compression method to show that $π_{fl} (G)\le c Δ$ for some absolute constant $c$ and $G$ a plane graph with maximum degree $Δ$. Moreover, we give some better (constant) upper bounds on $π_{fl} (G)$ for special classes of plane graphs.

math.CO↗

arXiv2012

On the facial Thue choice index via entropy compression

A sequence is nonrepetitive if it contains no identical consecutive subsequences. An edge colouring of a path is nonrepetitive if the sequence of colours of its consecutive edges is nonrepetitive. By the celebrated construction of Thue, it is possible to generate nonrepetitive edge colourings for arbitrarily long paths using only three colours. A recent generalization of this concept implies that we may obtain such colourings even if we are forced to choose edge colours from any sequence of lists of size 4 (while sufficiency of lists of size 3 remains an open problem). As an extension of these basic ideas, Havet, Jendrol', Soták and Škrabul'áková proved that for each plane graph, 8 colours are sufficient to provide an edge colouring so that every facial path is nonrepetitively coloured. In this paper we prove that the same is possible from lists, provided that these have size at least 12. We thus improve the previous bound of 291 (proved by means of the Lovász Local Lemma). Our approach is based on the Moser-Tardos entropy-compression method and its recent extensions by Grytczuk, Kozik and Micek, and by Dujmović, Joret, Kozik and Wood.

math.CO↗