Search arXivSearch

arXiv · 2006.15734

Pentagonal geometries with block sizes 3, 4 and 5

Abstract

A pentagonal geometry PENT($k$, $r$) is a partial linear space, where every line, or block, is incident with $k$ points, every point is incident with $r$ lines, and for each point $x$, there is a line incident with precisely those points that are not collinear with $x$. An opposite line pair in a pentagonal geometry consists of two parallel lines such that each point on one of the lines is not collinear with precisely those points on the other line. We give a direct construction for an infinite sequence of pentagonal geometries with block size 3 and connected deficiency graphs. Also we present 39 new pentagonal geometries with block size 4 and five with block size 5, all with connected deficiency graphs. Consequentially we determine the existence spectrum up to a few possible exceptions for PENT(4, $r$) that do not contain opposite line pairs and for PENT(4, $r$) with one opposite line pair. More generally, given $j$ we show that there exists a PENT(4, $r$) with $j$ opposite line pairs for all sufficiently large admissible $r$. Using some new group divisible designs with block size 5 (including types $2^{35}$, $2^{71}$ and $10^{23}$) we significantly extend the known existence spectrum for PENT(5, $r$).

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Anthony D. Forbes. 2020-07-27. Pentagonal geometries with block sizes 3, 4 and 5. https://arxiv.org/abs/2006.15734

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Random algebraic constructions for extremal and Ramsey problems

Building on Bukh's random algebraic method, we develop a framework for extremal and Ramsey problems involving apex hypergraphs. If $\mathcal{H}$ is a $(d-1)$-partite $(d-1)$-uniform hypergraph with $S$ edges and $\mathcal{H}(t)$ is obtained by adjoining $t$ vertices with common link $\mathcal{H}$, we prove that $\operatorname{ex}(n,\mathcal{H}(t))=Ω_{\mathcal{H}}(n^{d-1/S})$ for $t>9^{S+o_d(S)}$, which is best possible when $\mathcal{H}$ is Sidorenko. Our framework also yields sharper sided Zarankiewicz bounds, quantitative generalized Tur'an bounds, and diagonal multicolor Ramsey constructions. For each fixed $s\geq 2$ and $K\geq 3$, we further prove $\operatorname{r}_K(\mathcal K_{s,t};\mathcal K_n) =Θ_{s,t,K}((n/\log n)^s)$ for $t>9^{s+o(s)}$, extending a theorem of Alon and Rödl from factorial to exponential $t$. The main ingredients are interpolation on $m$-independent varieties, control of the dependencies imposed by symmetry, and linear spaces of forms whose nonzero members remain regular after a common algebraic slice. Limited edge independence then gives the spectral and local-density estimates needed for the Ramsey application.

math.CO

A note on vertex-critical induced subgraphs of shift graphs

Shift graphs, introduced by Erdős and Hajnal in 1964, form one of the simplest known non-recursive constructions of triangle-free graphs with arbitrarily large chromatic number. In this note, we identify a surprising property: for each integer $k \geq 1$, the smallest $k$-chromatic shift graph contains a \emph{unique} induced $k$-vertex-critical subgraph. We give an explicit description of this subgraph and prove its uniqueness. This provides a new family of vertex-critical triangle-free graphs of arbitrarily large chromatic number.

math.CO