Image de couverture de livre

Girth in $GF(q)$-representable matroids

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Davies, James, Hatzel, Meike, Knauer, Kolja, McCarty, Rose, Ueckerdt, Torsten
Format:	Preprint
Publié:	2025
Sujets:	Combinatorics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Girth in GF(q)$\textsf {GF}(q)$‐representable matroids
par: James Davies, et autres
Publié: (2025)

Odd coloring graphs with linear neighborhood complexity
par: Davies, James, et autres
Publié: (2025)

Strongly sublinear separators and bounded asymptotic dimension for sphere intersection graphs
par: Davies, James, et autres
Publié: (2025)

Clustered independence and bounded treewidth
par: Knauer, Kolja, et autres
Publié: (2023)

Partitioning a Planar Graph into two Triangle-Forests
par: Knauer, Kolja, et autres
Publié: (2024)

Decomposing a signed graph into rooted circuits
par: McCarty, Rose
Publié: (2023)

Finitary affine oriented matroids
par: Delucchi, Emanuele, et autres
Publié: (2020)

Lattice path matroids and quotients
par: Benedetti, Carolina, et autres
Publié: (2022)

Prime and polynomial distances in colourings of the plane
par: Davies, James, et autres
Publié: (2023)

On $k$-neighborly reorientations of oriented matroids
par: Hernández-Ortiz, Rangel, et autres
Publié: (2023)

Fat minors cannot be thinned (by quasi-isometries)
par: Davies, James, et autres
Publié: (2024)

A survey of degree-boundedness
par: Du, Xiying, et autres
Publié: (2024)

Strong odd coloring in minor-closed classes
par: Goetze, Miriam, et autres
Publié: (2025)

Tight bound on treedepth in terms of pathwidth and longest path
par: Hatzel, Meike, et autres
Publié: (2023)

Quasi-isometries between graphs with variable edge lengths
par: Davies, James, et autres
Publié: (2025)

The Erdős-Pósa property for circle graphs as vertex-minors
par: Campbell, Rutger, et autres
Publié: (2025)

On the circuits of splitting matroids representable over GF(p)
par: Malavadkar, Prashant, et autres
Publié: (2021)

The excluded minors for GF(5)-representable matroids on ten elements
par: Brettell, Nick
Publié: (2023)

Shellability of the quotient order on lattice path matroids
par: Benedetti, Carolina, et autres
Publié: (2025)

Most $q$-matroids are not representable
par: Degen, Sebastian, et autres
Publié: (2024)

Concepts of Dimension for Convex Geometries
par: Knauer, Kolja, et autres
Publié: (2023)

Coloring minimal Cayley graphs
par: García-Marco, Ignacio, et autres
Publié: (2024)

A Note on Polychromatic Colorings of Shift-Chains
par: Ueckerdt, Torsten
Publié: (2024)

What is and is not inside a Cayley graph?
par: Knauer, Kolja, et autres
Publié: (2025)

Hamiltonian connectivity of some base-cobase graphs
par: Martínez-Sandoval, Leonardo, et autres
Publié: (2025)

On graphs coverable by chubby shortest paths
par: Hatzel, Meike, et autres
Publié: (2025)

Computing $\vec{\mathcal{S}}$-DAGs and Parity Games
par: Hatzel, Meike, et autres
Publié: (2024)

Geometry of convex geometries
par: Chalopin, Jérémie, et autres
Publié: (2024)

On endomorphism universality of sparse graph classes
par: Knauer, Kolja, et autres
Publié: (2022)

The structure of group-labeled graphs forbidding an immersion
par: McCarty, Rose, et autres
Publié: (2026)

Counterexample to Babai's lonely colour conjecture
par: Davies, James, et autres
Publié: (2024)

On rigid regular graphs and a problem of Babai and Pultr
par: Knauer, Kolja, et autres
Publié: (2025)

Cell structure of mediangle graphs
par: Chepoi, Victor, et autres
Publié: (2025)

Sensitivity of $m$-ary functions and low degree partitions of Hamming graphs
par: Asensio, Sara, et autres
Publié: (2024)

Graphs whose Eulerian trails have unique labels
par: Kim, Donggyu, et autres
Publié: (2026)

Directed treewidth is closed under taking butterfly minors
par: Kim, Gunwoo, et autres
Publié: (2025)

Number of Edges in 3-Connected Graphs with Cyclic Neighborhoods
par: Schneider, Samuel, et autres
Publié: (2025)

The r-Dynamic Chromatic Number is Bounded in the Strong 2-Coloring Number
par: Goetze, Miriam, et autres
Publié: (2025)

Excluding a clique or a biclique in graphs of bounded induced matching treewidth
par: Abrishami, Tara, et autres
Publié: (2024)

Universality for graphs with bounded density
par: Alon, Noga, et autres
Publié: (2023)