Steps towards an elementary proof of frobenius' theorem

So far there has been elementary proof for Frobenius's theorem only in special cases: if the complement is solvable, see e.g. [3], if the complement is of even order, see e.g. [6]. In the first section we consider the case, when the order of the complement is odd. We define a graph the vertices of which are the set K# of elements of our Frobenius group with 0 fixed points. Two vertices are connected with an edge if and only if the corresponding elements commute. We prove with elementary methods that K is a normal subgroup in G if and only if there exists an element x in K# such that all elements of K# belonging to the connected component C of K# containing x are at most distance 2 from c and NG(C) is not a -group, where is the set of prime divisors of the Frobenius complement of G. In the second section we generalize the case when the order of the complement is even, proving that the Frobenius kernel is a normal subgroup, if a fixed element a of the complement, the order of which is a minimal prime diviso...