Related papers: On the Cameron-Praeger Conjecture

Steinberg conjectured in 1976 that every planar graph with no cycles of length four or five is 3-colorable. We disprove this conjecture.

In this paper, we present a classification of $2$-designs with $\gcd(r,\lambda)=1$ admitting flag-transitive automorphism groups. If $G$ is a flag-transitive automorphism group of a non-trivial $2$-design $\mathcal{D}$ with…

We prove the conjecture that exotic and block-exotic fusion systems coincide holds for all fusion systems on exceptional $p$-groups of maximal nilpotency class, where $p \geq 5$. This is done by considering a family of exotic fusion systems…

In this article, we study $2$-designs with $\lambda=2$ admitting a flag-transitive almost simple automorphism group with socle a finite simple exceptional group of Lie type, and we prove that such a $2$-design does not exist. In conclusion,…

An incidence structure consists simply of a set P of points and a set B of blocks, with a relation of incidence between points and blocks.A symmetric (v,k,\lambda) block design is the subject of this paper. The symmetric (n^2+n+1, n+1,1)…

Merker conjectured that if $k \ge 2$ is an integer and $G$ a 3-connected cubic planar graph of circumference at least $k$, then the set of cycle lengths of $G$ must contain at least one element of the interval $[k, 2k+2]$. We here prove…

In representation theory of finite groups, there is a well-known and important conjecture due to M. Brou\'e. He conjectures that, for any prime $p$, if a $p$-block $A$ of a finite group $G$ has an abelian defect group $P$, then $A$ and its…

A permutoid is a set of partial permutations that contains the identity and is such that partial compositions, when defined, have at most one extension in the set. In 2004 Peter Cameron conjectured that there can exist no algorithm that…

A positive integer $n$ is a Cayley number if every vertex-transitive graph of order $n$ is a Cayley graph. In 1983, Dragan Maru\v{s}i\v{c} posed the problem of determining the Cayley numbers. In this paper we give an infinite set $S$ of…

We show (among other things) that Brauer's k(B)-conjecture holds for defect groups with are central extensions of metacyclic 2-groups by cyclic groups. The same holds for defect groups which contain a central cyclic subgroup of index at…

A finite transitive permutation group is elusive if it contains no derangements of prime order. These groups are closely related to a longstanding open problem in algebraic graph theory known as the Polycirculant Conjecture, which asserts…

The well-known Steinberg's conjecture asserts that any planar graph without 4- and 5-cycles is 3 colorable. In this note we have given a short algorithmic proof of this conjecture based on the spiral chains of planar graphs proposed in the…

For every odd prime power $q$, a family of pairwise nonisomorphic normal arc-transitive divisible design Cayley digraphs with isomorphic neighborhood designs over a Heisenberg group of order $q^3$ is constructed. It is proved that these…

For a finite set of non-zero natural numbers that contains at least one element different from 1 and the least common multiple of any of its subsets, there exists a subset of at least half of its members which has a common divisor larger…

In a 1989 paper \cite{arasu2}, Arasu used an observation about multipliers to show that no $(352,27,2)$ difference set exists in any abelian group. The proof is quite short and required no computer assistance. We show that it may be applied…

Let $E/\mathbb{Q}$ be an elliptic curve and $p$ an odd prime. In 1991 Kolyvagin conjectured that the system of cohomology classes for torsion quotients of the $p$-adic Tate module of $E$ derived from Heegner points over ring class fields of…

Listed as No. 53 among the one hundred famous unsolved problems in [J. A. Bondy, U. S. R. Murty, Graph Theory, Springer, Berlin, 2008] is Steinberg's conjecture, which states that every planar graph without 4- and 5-cycles is 3-colorable.…

Let $G$ be a finite group, $p$ a prime and $B$ a Brauer $p$-block of $G$ with defect group $D$. We prove that if the number of irreducible ordinary characters in $B$ is $5$ then $D\cong C_5, C_7, D_8$ or $Q_8$, assuming that the…

Consider a group $G$ acting on a set $\Omega$, the vector $v_{a,b}$ is a vector with the entries indexed by the elements of $G$, and the $g$-entry is 1 if $g$ maps $a$ to $b$, and zero otherwise. A $(G,\Omega)$-Cameron-Liebler set is a…

Coding theory and $t$-designs have close connections and interesting interplay. In this paper, we first introduce a class of ternary linear codes and study their parameters. We then focus on their three-weight subcodes with a special weight…