:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Author:	Kuyanov, Fedor
Format:	Preprint
Published:	2024
Subjects:	Combinatorics 05C70
Online Access:	https://arxiv.org/abs/2405.18446
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

RSB bounds on the maximum cut
by: Harangi, Viktor
Published: (2025)

Three results towards the approximation of special maximum matchings in graphs
by: Mkrtchyan, Vahan
Published: (2024)

Lower bounds for the Randić index in terms of matching number
by: Akbari, Saieed, et al.
Published: (2024)

A lower bound on forcing numbers based on height functions
by: Aliyev, Fateh, et al.
Published: (2024)

A stability result for almost perfect matchings
by: Guo, Mingyang, et al.
Published: (2024)

Covering the edges of a graph with perfect matchings
by: Silina, Olha
Published: (2023)

Claw-free minimal matching covered graphs
by: Zhang, Yipei, et al.
Published: (2024)

The minimum number of vertices and edges of connected graphs with ind-match$(G) = p$, min-match$(G) = q$ and match$(G) = r$
by: Matsuda, Kazunori, et al.
Published: (2025)

On the fractional matching extendability of Cayley graphs of Abelian groups
by: Kuzman, Boštjan, et al.
Published: (2024)

Spectral radius and perfect k-matchings in t-connected graphs
by: Pan, Quanru, et al.
Published: (2026)

Minimum forcing numbers of perfect matchings of circular and prismatic graphs
by: Shi, Qiaoyun, et al.
Published: (2025)

Almost-perfect colorful matchings in three-edge-colored bipartite graphs
by: Boyadzhiyska, Simona, et al.
Published: (2025)

Distance spectral radius and perfect matchings in graphs with given fractional property
by: Zhou, Sizhong
Published: (2026)

Perfect matchings and $A_α$-spectral radius in 1-binding graphs
by: Zhou, Sizhong, et al.
Published: (2026)

Maximal independent sets in graphs with given matching number
by: Shi, Yongtang, et al.
Published: (2024)

Saved by the rook: a case of matchings and Hamiltonian cycles
by: Abreu, Marién, et al.
Published: (2021)

Exact values and improved bounds on $k$-neighborly families of boxes
by: Cheng, Xinbu, et al.
Published: (2023)

A sharp upper bound for the harmonious total chromatic number of graphs and multigraphs
by: Abreu, M., et al.
Published: (2024)

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

Induced matching vs edge open packing: trees and product graphs
by: Bresar, Bostjan, et al.
Published: (2024)

Optimal bounds for an Erdős problem on matching integers to distinct multiples
by: van Doorn, Wouter, et al.
Published: (2026)

Two sufficient conditions for graphs to admit path factors
by: Zhou, Sizhong, et al.
Published: (2023)

Hamiltonian paths extending a set of matchings in hypercubes
by: Ali, Abid, et al.
Published: (2025)

A generalised Ramsey--Turán problem for matchings
by: Keevash, Peter, et al.
Published: (2025)

A necessary and sufficient condition for bounds on the sum of a list of real numbers and its applications
by: Yang, Xiwu
Published: (2024)

Optimal matching under size priority
by: Enriquez, Nathanaël, et al.
Published: (2026)

Extreme local statistics in random graphs: maximum tree extension counts
by: Araújo, Pedro, et al.
Published: (2023)

Minimum maximal matchings in permutahedra
by: Brenner, Sofia, et al.
Published: (2025)

List packing number of bounded degree graphs
by: Cambie, Stijn, et al.
Published: (2023)

Topology of matching complexes of complete graphs via discrete Morse theory
by: Mondal, Anupam, et al.
Published: (2023)

Corrigendum to "Topology of matching complexes of complete graphs via discrete Morse theory'' [arXiv:2305.02973, Discrete Math. Theor. Comput. Sci. 26:3#13 (2024)]
by: Mondal, Anupam, et al.
Published: (2025)

Odd Covers of Complete Graphs and Hypergraphs
by: Leader, Imre, et al.
Published: (2024)

Balanced 1-Factorisations of 3- and 4-Regular Circulant Graphs
by: Mitchell, Jeremy
Published: (2024)

On the k-spanning cyclability of 4-valent Cayley graphs on Abelian groups
by: Alspach, Brian, et al.
Published: (2024)

A Discrete Logarithm Construction for Orthogonal Double Covers of the Complete Graph by Hamiltonian Paths
by: Ollis, M. A.
Published: (2025)

Grid designs
by: Danai, Alon, et al.
Published: (2026)

Generating simple near-bipartite bricks
by: Kothari, Nishad, et al.
Published: (2017)

Tight Bounds for Cycle-Edge Decompositions and Covers
by: Akbari, Saieed, et al.
Published: (2025)

Connecting hypercube 1-factors
by: Hollom, Lawrence, et al.
Published: (2025)

Strong binding numbers and factors
by: Chen, Guantao, et al.
Published: (2025)