AbstractLet Kn,n be the complete bipartite graph with n vertices in each partition. We denote M(C4,Kn,n) to be the minimum number of monochromatic copies of quadrilaterals in any 2-edge coloring of Kn,n. In this paper, we give an upper bound for M(C4,Kn,n) for all n using an explicit construction
AbstractLet KN be the complete graph on N vertices, and assume that each edge is assigned precisly o...
AbstractIf the edges of a graph G are colored using k colors, we consider the color distribution for...
AbstractFor integers n⩾1 and k⩾0, let Mk(n) represent the minimum number of monochromatic solutions ...
AbstractLet Kn,n be the complete bipartite graph with n vertices in each partition. We denote M(C4,K...
In 1959, Goodman [9] determined the minimum number of monochromatic triangles in a complete graph wh...
Abstract. In 1959, Goodman [8] determined the minimum number of monochromatic triangles in a complet...
<p>In 1959, Goodman <a href="http://www.sciencedirect.com/science/article/pii/S0095895613000324#br00...
The Zarankiewicz number z(m,n; s, t) is the maximum number of edges in a subgraph of Km,n that does ...
AbstractLet G=(V,E) be an edge-colored graph. A subgraph H is said to be monochromatic if all the ed...
In 1959, Goodman [9] determined the minimum number of monochromatic triangles in a complete graph wh...
The tree partition number of an r-edge-colored graph G, denoted by tr(G), is the minimum number k su...
For a graph G, a partiteness k ≥ 2 and a number of colours c, we define the multipartite Ramsey numb...
AbstractFor a fixed graph H, let f(n,H) denote the maximum possible number of edges not belonging to...
AbstractThe total chromatic number χT(G) of a graph G is the least number of colours needed to colou...
AbstractIf F and G are graphs, define M(G,F) to be the minimum number of monochromatic G that occur ...
AbstractLet KN be the complete graph on N vertices, and assume that each edge is assigned precisly o...
AbstractIf the edges of a graph G are colored using k colors, we consider the color distribution for...
AbstractFor integers n⩾1 and k⩾0, let Mk(n) represent the minimum number of monochromatic solutions ...
AbstractLet Kn,n be the complete bipartite graph with n vertices in each partition. We denote M(C4,K...
In 1959, Goodman [9] determined the minimum number of monochromatic triangles in a complete graph wh...
Abstract. In 1959, Goodman [8] determined the minimum number of monochromatic triangles in a complet...
<p>In 1959, Goodman <a href="http://www.sciencedirect.com/science/article/pii/S0095895613000324#br00...
The Zarankiewicz number z(m,n; s, t) is the maximum number of edges in a subgraph of Km,n that does ...
AbstractLet G=(V,E) be an edge-colored graph. A subgraph H is said to be monochromatic if all the ed...
In 1959, Goodman [9] determined the minimum number of monochromatic triangles in a complete graph wh...
The tree partition number of an r-edge-colored graph G, denoted by tr(G), is the minimum number k su...
For a graph G, a partiteness k ≥ 2 and a number of colours c, we define the multipartite Ramsey numb...
AbstractFor a fixed graph H, let f(n,H) denote the maximum possible number of edges not belonging to...
AbstractThe total chromatic number χT(G) of a graph G is the least number of colours needed to colou...
AbstractIf F and G are graphs, define M(G,F) to be the minimum number of monochromatic G that occur ...
AbstractLet KN be the complete graph on N vertices, and assume that each edge is assigned precisly o...
AbstractIf the edges of a graph G are colored using k colors, we consider the color distribution for...
AbstractFor integers n⩾1 and k⩾0, let Mk(n) represent the minimum number of monochromatic solutions ...
DOI
Add to ORKG