Alonso-González, ClementaNavarro Pérez, Miguel ÁngelSoler-Escrivá, Xaro2023-05-232023-05-232021-12Alonso-González, C., Navarro-Pérez, M. Á., & Soler-Escrivà, X. (2021). Optimum distance flag codes from spreads via perfect matchings in graphs. Journal of Algebraic Combinatorics, 54(4), 1279-1297.0925-9899https://hdl.handle.net/10016/37346In this paper, we study flag codes on the vector space Fnq , being q a prime power and Fq the finite field of q elements. More precisely, we focus on flag codes that attain the maximum possible distance (optimum distance flag codes) and can be obtained from a spread of Fnq . We characterize the set of admissible type vectors for this family of flag codes and also provide a construction of them based on well-known results about perfect matchings in graphs. This construction attains both the maximum distance for its type vector and the largest possible cardinality for that distance.19eng© The Author(s) 2021Atribución 3.0 EspañaNetwork codingSubspace codesSpreadsFlag codesGraphsPerfect matchingresearch articleMatemáticashttps://doi.org/10.1007/s10801-021-01086-yopen access127941297Journal of Algebraic Combinatorics54AR/0000033012