Image de couverture de livre

Tight Bounds for Cycle-Edge Decompositions and Covers

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Akbari, Saieed, Aloni, Jonny, Beikmohammadi, Arash, Clow, Alexander
Format:	Preprint
Publié:	2025
Sujets:	Combinatorics 05C70
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Tight Bounds on the Chromatic Edge Stability Index of Graphs
par: Akbari, Saieed, et autres
Publié: (2022)

Lower bounds for the Randić index in terms of matching number
par: Akbari, Saieed, et autres
Publié: (2024)

A Counterexample to a Conjecture of Lovász
par: Clow, Alexander, et autres
Publié: (2025)

A Conjecture on Rainbow Hamiltonian Cycle Decomposition
par: Javadi, Ramin, et autres
Publié: (2024)

Improved Decomposition Bounds for Partition Polytopes and Odd-Covers
par: Borgwardt, Steffen, et autres
Publié: (2025)

Spectrally symmetric orientations of graphs
par: Akbari, Saieed, et autres
Publié: (2025)

Cops and Robbers, Clique Covers, and Induced Cycles
par: Clow, Alexander, et autres
Publié: (2025)

A Linear Lower Bound for the Square Energy of Graphs
par: Akbari, Saieed, et autres
Publié: (2024)

Odd Covers of Complete Graphs and Hypergraphs
par: Leader, Imre, et autres
Publié: (2024)

Edge Determining Sets and Determining Index
par: McAvoy, Sean, et autres
Publié: (2022)

Covering the edges of a graph with perfect matchings
par: Silina, Olha
Publié: (2023)

Cycle-factors in oriented graphs
par: Wang, Zhilan, et autres
Publié: (2024)

Tight factorizations of girth-$g$-regular graphs
par: Dejter, Italo J.
Publié: (2021)

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

Decomposition of Cliques into $k$-Star-Forests
par: Nie, Jiaxi, et autres
Publié: (2025)

Line graphs and Nordhaus-Gaddum-type bounds for self-loop graphs
par: Akbari, Saieed, et autres
Publié: (2024)

Oriented Colouring Graphs of Bounded Degree and Degeneracy
par: Clow, Alexander, et autres
Publié: (2023)

Cycle Partitions in Dense Regular Digraphs and Oriented Graphs
par: Lo, Allan, et autres
Publié: (2023)

On Prime Matrix Product Factorizations
par: Akbari, Saieed, et autres
Publié: (2025)

Greedily Constructing Small Quasi-Kernels
par: Clow, Alexander
Publié: (2026)

Expanders Satisfy the Weak Meyniel Conjecture
par: Clow, Alexander
Publié: (2023)

On Oriented Colourings of Graphs on Surfaces
par: Clow, Alexander
Publié: (2024)

On odd covers of cliques and disjoint unions
par: Buchanan, Calum, et autres
Publié: (2024)

The Hypergraph Turán Densities of Tight Cycles Minus an Edge
par: Lidicky, Bernard, et autres
Publié: (2024)

A SAT-based Filtering Framework for Exact Coverings of K33 by Cliques of Order 3, 4 or 5
par: Kovař, Petr, et autres
Publié: (2026)

Almost-perfect colorful matchings in three-edge-colored bipartite graphs
par: Boyadzhiyska, Simona, et autres
Publié: (2025)

Connecting hypercube 1-factors
par: Hollom, Lawrence, et autres
Publié: (2025)

Strong binding numbers and factors
par: Chen, Guantao, et autres
Publié: (2025)

Two lower bounds for maximum matching
par: Kuyanov, Fedor
Publié: (2024)

Grid designs
par: Danai, Alon, et autres
Publié: (2026)

Generating simple near-bipartite bricks
par: Kothari, Nishad, et autres
Publié: (2017)

Balanced 1-Factorisations of 3- and 4-Regular Circulant Graphs
par: Mitchell, Jeremy
Publié: (2024)

Double Italian domination in trees
par: Shang, Weiping, et autres
Publié: (2026)

Exact values and improved bounds on $k$-neighborly families of boxes
par: Cheng, Xinbu, et autres
Publié: (2023)

On the k-spanning cyclability of 4-valent Cayley graphs on Abelian groups
par: Alspach, Brian, et autres
Publié: (2024)

A stability result for almost perfect matchings
par: Guo, Mingyang, et autres
Publié: (2024)

Refinement of a conjecture on positive square energy of graphs
par: Akbari, Saieed, et autres
Publié: (2025)

On removable edge subsets in graphs with a nowhere-zero $4$-flow
par: Mattiolo, Davide
Publié: (2025)

Relative Turán densities of ordered graphs
par: Reiher, Christian, et autres
Publié: (2025)

Minimum forcing numbers of perfect matchings of circular and prismatic graphs
par: Shi, Qiaoyun, et autres
Publié: (2025)