The minimum rank problem over finite fields

Simple item page
dc.creatorGrout, Jason
dc.date2008-01-18
dc.date.accessioned2026-07-07T08:55:28Z
dc.date.available2026-07-07T08:55:28Z
dc.descriptionThe structure of all graphs having minimum rank at most k over a finite field with q elements is characterized for any possible k and q. A strong connection between this characterization and polarities of projective geometries is explained. Using this connection, a few results in the minimum rank problem are derived by applying some known results from projective geometry.
dc.description23 pages, 5 figures, 1 Sage program
dc.identifierhttps://arxiv.org/abs/0801.2987
dc.identifierhttp://arxiv.org/abs/0801.2987
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/146282
dc.subjectCombinatorics
dc.subject05C50, 05C75, 15A03, 05B25, 51E20
dc.titleThe minimum rank problem over finite fields
dc.typetext

Files

Collections

arXiv