2006/12/12 by Barrett, Wayne, Grout, Jason, Loewy, Raphael · 1 citation
#05C50 #05C75 #15A03 #Combinatorics (math.CO) #FOS: Mathematics #Rings and Algebras (math.RA)
paper · doi:10.48550/arxiv.math/0612331
Our main result is a sharp bound for the number of vertices in a minimal forbidden subgraph for the graphs having minimum rank at most 3 over the finite field of order 2. We also list all 62 such minimal forbidden subgraphs. We conclude by exploring how some of these results over the finite field of order 2 extend to arbitrary fields and demonstrate that at least one third of the 62 are minimal forbidden subgraphs over an arbitrary field for the class of graphs having minimum rank at most 3 in that field.