Cover Image

A hierarchy of edge-weight symmetries in perfect matchings

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Bérczi, Kristóf, Csaplár, Viktor, Yamaguchi, Yutaro
Format:	Preprint
Published:	2026
Subjects:	Combinatorics Discrete Mathematics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

Cyclic ordering of split matroids
by: Bérczi, Kristóf, et al.
Published: (2024)

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

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)

Neighbour sum distinguishing edge-weightings with local constraints
by: Dailly, Antoine, et al.
Published: (2022)

On covering cubic graphs with three perfect matchings
by: Máčajová, Edita, et al.
Published: (2025)

Colouring t-perfect graphs
by: Chudnovsky, Maria, et al.
Published: (2024)

Contractions in perfect graph
by: Dupont-Bouillard, Alexandre, et al.
Published: (2024)

Sufficient conditions for perfect mixed tilings
by: Hurley, Eoin, et al.
Published: (2022)

Connected greedy colourings of perfect graphs and other classes: the good, the bad and the ugly
by: Beaudou, Laurent, et al.
Published: (2021)

The red-blue-yellow matching problem
by: Aprile, Manuel, et al.
Published: (2026)

Families without $s$-matchings: the other end
by: Kupavskii, Andrey, et al.
Published: (2026)

$θ$-free matching covered graphs
by: Joshi, Rohinee, et al.
Published: (2024)

Satisfying sequences for rainbow partite matchings
by: Kupavskii, Andrey, et al.
Published: (2025)

The average size of maximal matchings in graphs
by: Hertz, Alain, et al.
Published: (2022)

On the time complexity of finding a well-spread perfect matching in bridgeless cubic graphs
by: Ghanbari, Babak, et al.
Published: (2025)

On the edge expansion of random polytopes
by: Ferber, Asaf, et al.
Published: (2025)

Complexity of polytope diameters via perfect matchings
by: Nöbel, Christian, et al.
Published: (2024)

Extremal minimal bipartite matching covered graphs
by: Mallik, Amit Kumar, et al.
Published: (2024)

Induced matching treewidth and tree-independence number, revisited
by: Alon, Noga, et al.
Published: (2025)

On the matching arrangement of a graph, improper weight function problem and its application
by: Bolotnikov, Aleksey, et al.
Published: (2024)

A verified implementation of the Misra and Gries edge coloring algorithm
by: Bhoja, Arohee
Published: (2025)

A complete solution of the Erdős-Kleitman matching problem for $n\le 3s$
by: Kupavskii, Andrey, et al.
Published: (2025)

Restricted subgraphs of edge-colored graphs and applications
by: Sudakov, Benny
Published: (2024)

Multigraph edge-coloring with local list sizes
by: Dhawan, Abhishek
Published: (2023)

Vertex-edge domination on subclasses of bipartite graphs
by: Pandey, Arti, et al.
Published: (2025)

On the expressive power of $2$-edge-colourings of graphs
by: Bok, Jan, et al.
Published: (2025)

A Vizing-like theorem for union vertex-distinguishing edge coloring
by: Bousquet, Nicolas, et al.
Published: (2016)

More on the Erd\H os--Kleitman problem on matchings in set families
by: Kupavskii, Andrey, et al.
Published: (2026)

A polynomial bound on the pathwidth of graphs edge-coverable by $k$ shortest paths
by: Baste, Julien, et al.
Published: (2025)

An involution for trivariate symmetries of vincular patterns
by: Chen, Joanna N., et al.
Published: (2025)

Separating the edges of a graph by cycles and by subdivisions of $K_4$
by: Botler, Fábio, et al.
Published: (2024)

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

Bounds and extremal graphs for monitoring edge-geodetic sets in graphs
by: Foucaud, Florent, et al.
Published: (2024)

A Brooks-type theorem for the k-choosability of graphs with maximum local edge-connectivity k
by: Bastida, Sam, et al.
Published: (2026)