Volume 92, Issue 2 pp. 96-110
ARTICLE

On the independence number of graphs related to a polarity

Sam Mattheus

Corresponding Author

Sam Mattheus

Department of Mathematics, Vrije Universiteit Brussel, Brussel, Belgium

Correspondence Sam Mattheus, Department of Mathematics, Vrije Universiteit Brussel, Pleinlaan 2, 1050 Brussel, Belgium. Email: [email protected]

Search for more papers by this author
Francesco Pavese

Francesco Pavese

Dipartimento di Meccanica, Matematica e Management, Politecnico di Bari, Bari, Italy

Search for more papers by this author
Leo Storme

Leo Storme

Department of Mathematics, Ghent University, Ghent, Belgium

Search for more papers by this author
First published: 12 December 2018
Citations: 2

Abstract

We investigate the independence number of two graphs constructed from a polarity of urn:x-wiley:03649024:media:jgt22442:jgt22442-math-0001. For the first graph under consideration, the Erdős-Rényi graph urn:x-wiley:03649024:media:jgt22442:jgt22442-math-0002, we provide an improvement on the known lower bounds on its independence number. In the second part of the paper, we consider the Erdős-Rényi hypergraph of triangles urn:x-wiley:03649024:media:jgt22442:jgt22442-math-0003. We determine the exact magnitude of the independence number of urn:x-wiley:03649024:media:jgt22442:jgt22442-math-0004, urn:x-wiley:03649024:media:jgt22442:jgt22442-math-0005 even. This solves a problem posed by Mubayi and Williford [On the independence number of the ErdŐs-RÉnyi and projective norm graphs and a related hypergraph, J. Graph Theory, 56 (2007), pp. 113-127, Open Problem 3].

The full text of this article hosted at iucr.org is unavailable due to technical difficulties.