All partitions have small parts — Gallai–Ramsey numbers of bipartite graphs
نویسندگان
چکیده
منابع مشابه
Convex p-partitions of bipartite graphs
A set of vertices X of a graph G is convex if it contains all vertices on shortest paths between vertices of X. We prove that for fixed p ≥ 1, all partitions of the vertex set of a bipartite graph into p convex sets can be found in polynomial time.
متن کاملPartitions Excluding Specific Polygonal Numbers As Parts
A partition λ of the nonnegative integer n is a sequence of nonnegative integers λ1 ≥ λ2 ≥ · · · ≥ λr with λ1 + λ2 + · · · + λr = n. Each value λi, 1 ≤ i ≤ r, is called a part of the partition. In this note, we consider partitions of n with parts related to k-gonal numbers for some fixed integer k ≥ 3. Various works have appeared involving partitions into polygonal parts. For example, M. D. Hir...
متن کاملRamsey numbers for bipartite graphs with small bandwidth
We estimate Ramsey numbers for bipartite graphs with small bandwidth and bounded maximum degree. In particular we determine asymptotically the two and three color Ramsey numbers for grid graphs. More generally, we determine the two color Ramsey number for bipartite graphs with small bandwidth and bounded maximum degree and the three color Ramsey number for such graphs with the additional assump...
متن کاملGraphs, partitions and Fibonacci numbers
The Fibonacci number of a graph is the number of independent vertex subsets. In this paper, we investigate trees with large Fibonacci number. In particular, we show that all trees with n edges and Fibonacci number > 2n−1 + 5 have diameter ≤ 4 and determine the order of these trees with respect to their Fibonacci numbers. Furthermore, it is shown that the average Fibonacci number of a star-like ...
متن کاملk-Efficient partitions of graphs
A set $S = {u_1,u_2, ldots, u_t}$ of vertices of $G$ is an efficientdominating set if every vertex of $G$ is dominated exactly once by thevertices of $S$. Letting $U_i$ denote the set of vertices dominated by $u_i$%, we note that ${U_1, U_2, ldots U_t}$ is a partition of the vertex setof $G$ and that each $U_i$ contains the vertex $u_i$ and all the vertices atdistance~1 from it in $G$. In this ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2019
ISSN: 0166-218X
DOI: 10.1016/j.dam.2018.06.031