Cover Image

Cyclic ordering of split matroids

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Bérczi, Kristóf, Jánosik, Áron, Mátravölgyi, Bence
Format:	Preprint
Published:	2024
Subjects:	Combinatorics Discrete Mathematics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A note on embracing exchange sequences in oriented matroids
by: Bérczi, Kristóf, et al.
Published: (2025)

A hierarchy of edge-weight symmetries in perfect matchings
by: Bérczi, Kristóf, et al.
Published: (2026)

On approximating the rank of graph divisors
by: Bérczi, Kristóf, et al.
Published: (2022)

The Rainbow Arborescence Problem on Cycles
by: Bérczi, Kristóf, et al.
Published: (2025)

Matroid products via submodular coupling
by: Bérczi, Kristóf, et al.
Published: (2024)

Interaction between skew-representability, tensor products, extension properties, and rank inequalities
by: Bérczi, Kristóf, et al.
Published: (2025)

How to see the forest for the trees
by: Bérczi-Kovács, Erika, et al.
Published: (2025)

Approximating maximum-size properly colored forests
by: Bai, Yuhang, et al.
Published: (2024)

Rainbow Arborescence Conjecture
by: Bérczi, Kristóf, et al.
Published: (2024)

Basis sequence reconfiguration in the union of matroids
by: Hanaka, Tesshu, et al.
Published: (2024)

Obstructions and dualities for matroid depth parameters
by: Gajarský, Jakub, et al.
Published: (2025)

Closure property of contraction-depth of matroids
by: Brianski, Marcin, et al.
Published: (2023)

Inverse matroid optimization under subset constraints
by: Bérczi, Kristóf, et al.
Published: (2025)

Lattice path matroids and quotients
by: Benedetti, Carolina, et al.
Published: (2022)

Number of Edges in 3-Connected Graphs with Cyclic Neighborhoods
by: Schneider, Samuel, et al.
Published: (2025)

Augmenting a hypergraph to have a matroid-based $(f,g)$-bounded $(α,β)$-limited packing of rooted hypertrees
by: Hoppenot, Pierre, et al.
Published: (2024)

Uniform density in matroids, matrices and graphs
by: Devriendt, Karel, et al.
Published: (2023)

Hypergraphs with Polynomial Representation: Introducing $r$-splits
by: Pitois, François, et al.
Published: (2022)

Filling some gaps on the edge coloring problem of split graphs
by: Couto, Fernanda, et al.
Published: (2024)

Equality cases of the Stanley--Yan log-concave matroid inequality
by: Chan, Swee Hong, et al.
Published: (2024)

On the sizes of BDDs and ZDDs representing matroids
by: Emoto, Hiromi, et al.
Published: (2024)

Asymptotically faster algorithms for recognizing $(k,\ell)$-sparse graphs
by: Deák, Bence, et al.
Published: (2026)

Subdivisions in dicritical digraphs with large order or digirth
by: Picasarri-Arrieta, Lucas, et al.
Published: (2024)

On the order-diameter ratio of girth-diameter cages
by: Cambie, Stijn, et al.
Published: (2025)

Tree decompositions with small width, spread, order and degree
by: Wood, David R.
Published: (2025)

List coloring ordered graphs with forbidden induced subgraphs
by: Piecyk, Marta, et al.
Published: (2025)

Fixed-parameter tractability and hardness for Steiner rooted and locally connected orientations
by: Bérczi, Kristóf, et al.
Published: (2025)

Asymptotic analysis and efficient random sampling of directed ordered acyclic graphs
by: Pépin, Martin, et al.
Published: (2023)

A bound for the cops and robber problem in terms of 2-component order connectivity
by: Jain, Suryaansh, et al.
Published: (2024)

Planar induced paths via a decomposition into non-crossing ordered graphs
by: Duron, Julien, et al.
Published: (2025)

Characterizing traces of processes defined by precedence and response constraints: an order theory approach
by: Dukes, Mark, et al.
Published: (2023)

Minimum number of arcs in $k$-critical digraphs with order at most $2k-1$
by: Picasarri-Arrieta, Lucas, et al.
Published: (2023)

Quadratic-Time Algorithm for the Maximum-Weight $(k, \ell)$-Sparse Subgraph Problem
by: Deák, Bence, et al.
Published: (2025)

On complete classes of valuated matroids
by: Husić, Edin, et al.
Published: (2021)

A composition theory for upward planar orders
by: Dong, Xue, et al.
Published: (2025)

A Fast Algorithm for Finding Minimum Weight Cycles in Mining Cyclic Graph Topologies
by: Shakeri, Heman, et al.
Published: (2025)

Complexity of approximate conflict-free, linearly-ordered, and nonmonochromatic hypergraph colourings
by: Nakajima, Tamio-Vesa, et al.
Published: (2025)

Asynchronous dynamics of isomorphic Boolean networks
by: Bridoux, Florian, et al.
Published: (2024)

HIST-Critical Graphs and Malkevitch's Conjecture
by: Goedgebeur, Jan, et al.
Published: (2024)

Grid Minors and Products
by: Dujmović, Vida, et al.
Published: (2024)