相关论文: Monochromatic Edges in Complete Multipartite Hyper…
Let $\chi_{\Delta}(\mathbb{R}^{n})$ denote the minimum number of colors needed to color $\mathbb{R}^{n}$ so that there will not be a monochromatic equilateral triangle with side length $1$. Using the slice rank method, we reprove a result…
This paper introduces a natural generalization of the classical edge coloring problem in graphs that provides a useful abstraction for two well-known problems in multicast switching. We show that the problem is NP-hard and evaluate the…
In this work, we continue the study of vertex colorings of graphs, in which adjacent vertices are allowed to be of the same color as long as each monochromatic connected component is of relatively small cardinality. We focus on colorings…
We introduce the triple crossing number, a variation of crossing number, of a graph, which is the minimal number of crossing points in all drawings with only triple crossings of the graph. It is defined to be zero for a planar graph, and to…
A colouring of a hypergraph's vertices is polychromatic if every hyperedge contains at least one vertex of each colour; the polychromatic number is the maximum number of colours in such a colouring. Its dual, the cover-decomposition number,…
In this paper we focus on the problem of finding (small) subhypergraphs in a (large) hypergraph. We use this problem to illustrate that reducing hypergraph problems to graph problems by working with the 2-section is not always a reasonable…
The (weak) chromatic number of a hypergraph $H$, denoted by $\chi(H)$, is the smallest number of colors required to color the vertices of $H$ so that no hyperedge of $H$ is monochromatic. For every $2\le k\le d+1$, denote by $\chi_L(k,d)$…
Aharoni and Berger conjectured that in any bipartite multigraph that is properly edge-coloured by $n$ colours with at least $n + 1$ edges of each colour there must be a matching that uses each colour exactly once. In this paper we consider…
We consider the problem of minimising the number of edges that are contained in triangles, among $n$-vertex graphs with a given number of edges. We prove a conjecture of F\"uredi and Maleki that gives an exact formula for this minimum, for…
A matching $M$ in a graph $G$ is {\em semistrong} if every edge of $M$ has an endvertex of degree one in the subgraph induced by the vertices of $M$. A {\em semistrong edge-coloring} of a graph $G$ is a proper edge-coloring in which every…
We consider space-efficient algorithms for two-coloring $n$-uniform hypergraphs $H=(V,E)$ in the streaming model, when the hyperedges arrive one at a time. It is known that any such hypergraph with at most $0.7 \sqrt{\frac{n}{\ln n}} 2^n$…
A perfect matching M in an edge-colored complete bipartite graph K_{n,n} is rainbow if no pair of edges in M have the same color. We obtain asymptotic enumeration results for the number of rainbow matchings in terms of the maximum number of…
Binary classification is one of the most common problem in machine learning. It consists in predicting whether a given element belongs to a particular class. In this paper, a new algorithm for binary classification is proposed using a…
Let $m^*(n)$ be the minimum number of edges in an $n$-uniform simple hypergraph that is not two colorable. We prove that $m^*(n)=\Omega(4^n/\ln^2(n))$. Our result generalizes to $r$-coloring of $b$-simple uniform hypergraphs. For fixed $r$…
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…
We prove asymptotically optimal bounds on the number of edges a graph $G$ must have in order that any $r$-colouring of $E(G)$ has a colour class which contains every $D$-degenerate graph on $n$ vertices with bounded maximum degree. We also…
For an edge-colored complete graph, we define the color degree of a node as the number of colors appearing on edges incident to it. In this paper, we consider colorings that don't contain tricolored triangles (also called rainbow…
Consider a problem where we are given a bipartite graph H with vertices arranged on two horizontal lines in the plane, such that the two sets of vertices placed on the two lines form a bipartition of H. We additionally require that H admits…
We answer a question of Gy\'arf\'as and S\'ark\"ozy from 2013 by showing that every 2-edge-coloured complete 3-uniform hypergraph can be partitioned into two monochromatic tight paths of different colours. We also give a lower bound for the…
Given a coloring of the edges of the complete graph on n vertices in k colors, by considering the neighbors of an arbitrary vertex it follows that there is a monochromatic diameter two subgraph on at least 1+(n-1)/k vertices. We show that…