We consider a variety of problems in extremal graph and set theory.
The {\em chromatic number} of G, χ(G), is the smallest integer k
such that G is k-colorable.
The {\it square} of G, written G2, is the supergraph of G in which also
vertices within distance 2 of each other in G are adjacent.
A graph H is a {\it minor} of G if H
can be obtained from a subgraph of G by contracting edges.
We show that the upper bound for χ(G2)
conjectured by Wegner (1977) for planar graphs
holds when G is a K4-minor-free graph.
We also show that χ(G2) is equal to the bound
only when G2 contains a complete graph of that order.
One of the central problems of extremal hypergraph theory is
finding the maximum number of edges in a hypergraph
that does not contain a specific forbidden structure.
We consider as a forbidden structure a fixed number of members
that have empty common intersection
as well as small union.
We obtain a sharp upper bound on the size of uniform hypergraphs
that do not contain this structure,
when the number of vertices is sufficiently large.
Our result is strong enough to imply the same sharp upper bound
for several other interesting forbidden structures
such as the so-called strong simplices and clusters.
The {\em n-dimensional hypercube}, Qn,
is the graph whose vertex set is {0,1}n and
whose edge set consists of the vertex pairs
differing in exactly one coordinate.
The generalized Tur\'an problem asks for the maximum number
of edges in a subgraph of a graph G that does not contain
a forbidden subgraph H.
We consider the Tur\'an problem where G is Qn and
H is a cycle of length 4k+2 with k≥3.
Confirming a conjecture of Erd{\H o}s (1984),
we show that the ratio of the size of such a subgraph of Qn
over the number of edges of Qn is o(1),
i.e. in the limit this ratio approaches 0
as n approaches infinity