Imagen de Portada

Decomposition of Cliques into $k$-Star-Forests

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Nie, Jiaxi, Ren, Yibo, Wu, Hehui
Formato:	Preprint
Publicado:	2025
Materias:	Combinatorics 05B40, 05C35, 05C70
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

A SAT-based Filtering Framework for Exact Coverings of K33 by Cliques of Order 3, 4 or 5
por: Kovař, Petr, et al.
Publicado: (2026)

On asymptotic packing of convex geometric and ordered graphs
por: Nie, Jiaxi, et al.
Publicado: (2022)

Sidorenko Hypergraphs and Random Turán Numbers
por: Nie, Jiaxi, et al.
Publicado: (2023)

Random Turán Problems for Hypergraph Expansions
por: Nie, Jiaxi, et al.
Publicado: (2024)

Proof of Thomassen's Conjecture on Highly connected subgraphs with large chromatic number
por: Polavarapu, Achintya Raya
Publicado: (2026)

$k$-fault-tolerant graphs for $p$ disjoint complete graphs of order $c$
por: Cichacz, Sylwia, et al.
Publicado: (2022)

Localized Erdős-Pósa Property for Subdivisions
por: Ai, Icey Siyi, et al.
Publicado: (2025)

Optimal decomposition of $K_{18}$ and $K_{19}$ into $K_3$ and $K_4$
por: Kovář, Petr, et al.
Publicado: (2025)

Minimum covering by triples, quadruples and quintuples with minimum excess
por: Kovář, Petr, et al.
Publicado: (2026)

Sets of equiangular lines in dimension $18$ constructed from $A_9 \oplus A_9 \oplus A_1$
por: Lin, Yen-chi Roger, et al.
Publicado: (2025)

A cube dismantling problem related to bootstrap percolation
por: Barát, János, et al.
Publicado: (2026)

A generalization of an ear decomposition and k-trees in highly connected star-free graphs
por: Maezawa, Shun-ichi, et al.
Publicado: (2025)

Difference Methods for Double-Change Covering Designs
por: Chafee, Amanda Lynn, et al.
Publicado: (2022)

Spectral conditions for spanning $k$-trees or $k$-ended-trees of $t$-connected graphs
por: Lin, Jifu, et al.
Publicado: (2024)

Relative Turán densities of ordered graphs
por: Reiher, Christian, et al.
Publicado: (2025)

The Minimum Number of Edges in $(p+1)K_2$-Saturated Graphs
por: Zhou, Xiaoteng, et al.
Publicado: (2025)

The saturation number of $K^s_t$
por: Zhao, Xinghui, et al.
Publicado: (2026)

A (simple) proof of the rna conjecture on powers of cycles
por: Feghali, Carl, et al.
Publicado: (2024)

Characterization of the structure of $k$-edge-maximal graphs
por: Xia, Zheng-Jiang, et al.
Publicado: (2026)

The minimum size of a $k$-connected locally nonforesty graph
por: Li, Chengli, et al.
Publicado: (2025)

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

On the number of triangles in $K_4$-free graphs
por: He, Jialin, et al.
Publicado: (2025)

Tiling randomly perturbed multipartite graphs
por: Gomez-Leos, Enrique, et al.
Publicado: (2025)

Cyclic subsets in regular Dirac graphs
por: Draganić, Nemanja, et al.
Publicado: (2025)

Spanning spheres in Dirac hypergraphs
por: Illingworth, Freddie, et al.
Publicado: (2024)

Tiling randomly perturbed bipartite graphs
por: Gomez-Leos, Enrique, et al.
Publicado: (2024)

Monochromatic graph decompositions inspired by anti-Ramsey colorings
por: Caro, Yair, et al.
Publicado: (2024)

Hypergraph saturation for the bow tie
por: Cambie, Stijn, et al.
Publicado: (2024)

On essentially 4-edge-connected cubic bricks
por: Kothari, Nishad, et al.
Publicado: (2018)

Spanning k-trees and distance spectral radius in graphs
por: Zhou, Sizhong, et al.
Publicado: (2023)

Improved Decomposition Bounds for Partition Polytopes and Odd-Covers
por: Borgwardt, Steffen, et al.
Publicado: (2025)

Loose Hamiltonicity
por: Lang, Richard, et al.
Publicado: (2025)

Packing colourings in complete bipartite graphs and the inverse problem for correspondence packing
por: Cambie, Stijn, et al.
Publicado: (2023)

A Degree-Preserving Builder--Chooser Game
por: London, András
Publicado: (2026)

Cycle Partitions in Dense Regular Digraphs and Oriented Graphs
por: Lo, Allan, et al.
Publicado: (2023)

On the Hypergraph Nash-Williams' Conjecture
por: Henderson, Cicely, et al.
Publicado: (2025)

Spanning k-trees, odd [1,b]-factors and spectral radius in binding graphs
por: Wu, Jiancheng, et al.
Publicado: (2025)

On the extrema of the mean subtree order of graphs
por: Cambie, Stijn, et al.
Publicado: (2025)

Chords of longest cycles in graphs with large circumferences
por: Wu, Haidong, et al.
Publicado: (2025)

Chords of longest cycles passing through a specified small set
por: Wu, Haidong, et al.
Publicado: (2025)