Graph crossing numbers quantify the minimum number of edge intersections in any planar drawing of a graph, an essential parameter in both theoretical and applied graph theory. The study of crossing ...

A realizable degree sequence can be realized in many ways as a graph. There are several tests for determining realizability of a degree sequence. Up to now, not much was known about the common ...

We consider the degrees of those irreducible characters of a group G whose kernels do not contain a given normal subgroup N. We show that if $N\subseteq G^{\prime ...