相关论文: Monochromatic cycle partitions in local edge colou…

A graph $G$ arrows a graph $H$ if in every $2$-edge-coloring of $G$ there exists a monochromatic copy of $H$. Schelp had the idea that if the complete graph $K_n$ arrows a small graph $H$, then every "dense" subgraph of $K_n$ also arrows…

In this note we consider a Ramsey property of random $d$-regular graphs, $\mathcal{G}(n,d)$. Let $r\ge 2$ be fixed. Then w.h.p. the edges of $\mathcal{G}(n, 2r)$ can be colored such that every monochromatic component has size $o(n)$. On the…

Let $G = (V,E)$ be a finite simple graph. Recall that a proper coloring of $G$ is a mapping $\varphi: V\to\{1,\ldots,k\}$ such that every color class induces an independent set. Such a $\varphi$ is called a semi-matching coloring if the…

Let G be a vertex-colored graph. A vertex cut S of G is called a monochromatic vertex cut if the vertices of S are colored with the same color. A graph G is monochromatically vertex-disconnected if any two nonadjacent vertices of G has a…

A proper vertex-colouring of a simple graph $G$ is said to be odd if, for every non-isolated vertex $v$ of $G$, some colour appears an odd number of times in the neighbourhood of $v$. We show that if $G$ embeds in the torus, then it admits…

A 2-coloring of a hypergraph is a mapping from its vertices to a set of two colors such that no edge is monochromatic. Let $H_k(n,m)$ be a random $k$-uniform hypergraph on $n$ vertices formed by picking $m$ edges uniformly, independently…

We consider edge colorings of graphs. An edge coloring is a majority coloring if for every vertex at most half of the edges incident with it are in one color. And edge coloring is a distinguishing coloring if for every non-trivial…

We prove that every graph with circumference at most $k$ is $O(\log k)$-colourable such that every monochromatic component has size at most $O(k)$. The $O(\log k)$ bound on the number of colours is best possible, even in the setting of…

It is proved that for integers $b, r$ such that $3 \leq b < r \leq \binom{b+1}{2} - 1$, there exists a red/blue edge-colored graph such that the red degree of every vertex is $r$, the blue degree of every vertex is $b$, yet in the closed…

We show that for every $\eta>0$, there exists $n_0$ such that for every even $n$, $n\ge n_0$, and every graph $G$ with $(2+\eta)n$ vertices and minimum degree at least $(7/4+4\eta)n$, each colouring of the edges of $G$ with three colours…

We show that for every {\eta} > 0 there exists an integer n_0 such that every 2-colouring of the 3-uniform complete hypergraph on n \geq n_0 vertices contains two disjoint monochromatic tight cycles of distinct colours that together cover…

Let $G$ be a graph whose edges are coloured with $k$ colours, and $\mathcal H=(H_1,\dots , H_k)$ be a $k$-tuple of graphs. A monochromatic $\mathcal H$-decomposition of $G$ is a partition of the edge set of $G$ such that each part is either…

An edge colouring of a graph $G$ is called acyclic if it is proper and every cycle contains at least three colours. We show that for every $\varepsilon>0$, there exists a $g=g(\varepsilon)$ such that if $G$ has girth at least $g$ then $G$…

A general (convex) polytope $P\subset\mathbb R^d$ and its edge-graph $G_P$ can have very distinct symmetry properties. We construct a coloring (of the vertices and edges) of the edge-graph so that the combinatorial symmetry group of the…

Proper vertex colorings of a graph are related to its boundary map, also called its signed vertex-edge incidence matrix. The vertex Laplacian of a graph, a natural extension of the boundary map, leads us to introduce nowhere-harmonic…

Let $S$ be a set of four points chosen independently, uniformly at random from a square. Join every pair of points of $S$ with a straight line segment. Color these edges red if they have positive slope and blue, otherwise. We show that the…

We extend results of Gy\'arf\'as and F\"uredi on the largest monochromatic component in $r$-colored complete $k$-uniform hypergraphs to the setting of random hypergraphs. We also study long monochromatic loose cycles in $r$-colored random…

We prove that every $n$-vertex graph with at least $\binom{n}{2} - (n - 4)$ edges has a fractional triangle decomposition, for $n \ge 7$. This is a key ingredient in our proof, given in a companion paper, that every $n$-vertex $2$-coloured…

A matching $M$ in a graph $G$ is $r$-degenerate if the subgraph of $G$ induced by the set of vertices incident with an edge in $M$ is $r$-degenerate. Goddard, Hedetniemi, Hedetniemi, and Laskar (Generalized subgraph-restricted matchings in…

Given an $r$-edge-coloured complete graph $K_n$, how many monochromatic connected components does one need in order to cover its vertex set? This natural question is a well-known essentially equivalent formulation of the classical Ryser's…