Cover Image

A parameterized algorithm for $K_r$-factors in graphs of high minimum degree

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Gan, Luyining, Han, Jie, Hu, Jie
Format:	Preprint
Published:	2023
Subjects:	Combinatorics Computational Complexity
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On the Keevash-Knox-Mycroft Conjecture
by: Gan, Luyining, et al.
Published: (2022)

Exact minimum co-degree conditions for $\ell$-Hamiltonicity in hypergraphs
by: Gan, Luyining, et al.
Published: (2026)

A Hypergraph Container Method on Spread SAT: Approximation and Speedup
by: Han, Zicheng, et al.
Published: (2026)

On the parameterized complexity of the Maker-Breaker domination game
by: Bagan, Guillaume, et al.
Published: (2026)

Non-crossing $H$-graphs: a generalization of proper interval graphs admitting FPT algorithms
by: Bonomo-Braberman, Flavia, et al.
Published: (2025)

Note on the codegree version of the Erdős--Ko--Rado theorem
by: Gan, Luyining, et al.
Published: (2026)

A near-optimal Quadratic Goldreich-Levin algorithm
by: Briët, Jop, et al.
Published: (2025)

On hardness of computing analytic Brouwer degree
by: Chakraborty, Somnath
Published: (2023)

Between proper and square coloring of planar graphs, hardness and extremal graphs
by: Delépine, Thomas
Published: (2026)

Sensitivity and Hamming graphs
by: Asensio, Sara, et al.
Published: (2025)

Complexity and algorithms for matching cut problems in graphs without long induced paths and cycles
by: Le, Hoang-Oanh, et al.
Published: (2023)

The high order spectral extrema of $2K_r$-free graphs
by: Bu, Changjiang, et al.
Published: (2026)

$C_{2k+1}$-coloring of bounded-diameter graphs
by: Piecyk, Marta
Published: (2024)

Bounded degree QBF and positional games
by: Oijid, Nacim
Published: (2024)

Boolean functions on high-dimensional expanders
by: Dikstein, Yotam, et al.
Published: (2018)

Low-degree learning and the metric entropy of polynomials
by: Eskenazis, Alexandros, et al.
Published: (2022)

On the degree of polynomials computing square roots mod p
by: Kedlaya, Kiran, et al.
Published: (2023)

Finding large $k$-colorable induced subgraphs in (bull, chair)-free and (bull,E)-free graphs
by: Hodur, Nadzieja, et al.
Published: (2025)

Maximum spread of $K_r$-minor free graphs
by: Wang, Wenyan, et al.
Published: (2024)

Agreement theorems for high dimensional expanders in the small soundness regime: the role of covers
by: Dikstein, Yotam, et al.
Published: (2023)

The Borsuk number of a graph
by: Cáceres, José, et al.
Published: (2026)

Variants of VC dimension and their applications to dynamics
by: Gao, Guorong, et al.
Published: (2023)

The parameterized complexity of Strong Conflict-Free Vertex-Connection Colorability
by: Feghali, Carl, et al.
Published: (2025)

A structural description of Zykov and Blanche Descartes graphs
by: Marin, Malory, et al.
Published: (2024)

Combinatorial refinement on circulant graphs
by: Kluge, Laurence
Published: (2022)

On full-separating sets and related codes in graphs
by: Chakraborty, Dipayan, et al.
Published: (2024)

Temporal Reachability Dominating Sets: contagion in temporal graphs
by: Kutner, David C., et al.
Published: (2023)

On the hardness of recognizing graphs of small mim-width and its variants
by: la Tour, Max Dupré, et al.
Published: (2025)

Complexity results for a cops and robber game on directed graphs
by: Ben-Ameur, Walid, et al.
Published: (2024)

Random regular graph states are complex at almost any depth
by: Ghosh, Soumik, et al.
Published: (2024)

Induced subgraphs of $K_r$-free graphs and the Erdős--Rogers problem
by: Gishboliner, Lior, et al.
Published: (2024)

Monochromatic cycle partitions of $r$-edge-coloured graphs with high minimum degree
by: Di Braccio, Francesco, et al.
Published: (2026)

Parks: A Doubly Infinite Family of NP-Complete Puzzles and Generalizations of A002464
by: Minevich, Igor, et al.
Published: (2024)

Smoothed analysis for graph isomorphism
by: Anastos, Michael, et al.
Published: (2024)

A Note on the Complexity of Directed Clique
by: Gutowski, Grzegorz, et al.
Published: (2026)

A combinatorial view of Holant problems on higher domains
by: Liu, Yin
Published: (2024)

A Subexponential Reduction from Product Partition to Subset Sum
by: Costandin, Marius
Published: (2024)

A criterion for Andrásfai--Erdős--Sós type theorems and applications
by: Hou, Jianfeng, et al.
Published: (2024)

The largest $K_r$-free set of vertices in a random graph
by: Bohman, Tom, et al.
Published: (2026)

On the complexity of global Roman domination problem in graphs
by: Reddy, Sangam Balchandar, et al.
Published: (2026)