Triangle-free induced subgraphs of the unitary polarity graph

Sam Mattheus, Francesco Pavese

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)

Abstract

Let ⊥ be a unitary polarity of a finite projective plane π of order q 2. The unitary polarity graph is the graph with vertex set the points of π where two vertices x and y are adjacent if x∈y . We show that a triangle-free induced subgraph of the unitary polarity graph of an arbitrary projective plane has at most (q 4+q)∕2 vertices. When π is the Desarguesian projective plane PG(2,q 2) and q is even, we show that the upper bound is asymptotically sharp, by providing an example on q 4∕2 vertices. Finally, the case when π is the Figueroa plane is discussed.

Original languageEnglish
Pages (from-to)83-96
Number of pages14
JournalEuropean Journal of Combinatorics
Volume72
DOIs
Publication statusPublished - 1 Aug 2018

Fingerprint

Dive into the research topics of 'Triangle-free induced subgraphs of the unitary polarity graph'. Together they form a unique fingerprint.

Cite this