6 research outputs found
Forbidden subgraphs and complete partitions
A graph is called an -graph if its vertex set can be partitioned into
parts of size at most with at least one edge between any two parts. Let
be the minimum for which there exists an -free -graph.
In this paper we build on the work of Axenovich and Martin, obtaining improved
bounds on this function when is a complete bipartite graph, even cycle, or
tree. Some of these bounds are best possible up to a constant factor and
confirm a conjecture of Axenovich and Martin in several cases. We also
generalize this extremal problem to uniform hypergraphs and prove some initial
results in that setting