Imagen de Portada

On a conjecture that strengthens Kundu's $k$-factor Theorem

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Shook, James M.
Formato:	Preprint
Publicado:	2022
Materias:	Combinatorics 05C40
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Connected equitably $Δ$-colorable realizations with $k$-factors
por: Shook, James M.
Publicado: (2025)

The proof of a conjecture about cages
por: Pan, Xiang-Feng, et al.
Publicado: (2024)

Splitter Theorems for Graph Immersions
por: DeVos, Matt, et al.
Publicado: (2018)

A conjecture implying Thomassen's chord conjecture in graph theory
por: Zhan, Xingzhi
Publicado: (2024)

Solutions to the linkage conjecture in tournaments
por: Zhou, Jia, et al.
Publicado: (2024)

Asymptotic structure. V. The coarse Menger conjecture in bounded path-width
por: Nguyen, Tung, et al.
Publicado: (2025)

Proof of the linkage conjecture for highly connected tournaments
por: Zhou, Jia, et al.
Publicado: (2025)

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

An Ore-type Theorem for Oriented Discrepancy of Hamilton Cycles
por: Chang, Yufei, et al.
Publicado: (2026)

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

Robustness of the Sauer-Spencer Theorem
por: Allen, Peter, et al.
Publicado: (2025)

On the $k$-linkage problem for generalizations of semicomplete digraphs
por: Zhou, Jia, et al.
Publicado: (2025)

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

Weak multiset sequenceability and weak BHR conjecture
por: Costa, Simone
Publicado: (2024)

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

Cycle decompositions in $k$-uniform hypergraphs
por: Lo, Allan, et al.
Publicado: (2022)

Decomposition of Cliques into $k$-Star-Forests
por: Nie, Jiaxi, et al.
Publicado: (2025)

Refining tree-decompositions so that they display the k-blocks
por: Albrechtsen, Sandra
Publicado: (2024)

Counting $k$-cycles in $5$-connected planar triangulations
por: Agrahari, Gyaneshwar, et al.
Publicado: (2025)

Extending Thomassen's conjecture to directed graphs
por: Christoph, Micha, et al.
Publicado: (2025)

Twin-width of graphs with tree-structured decompositions
por: Heinrich, Irene, et al.
Publicado: (2023)

On the Edge-Connectivity of the Square of a Graph
por: Balbuena, Camino, et al.
Publicado: (2024)

A degree sum condition for the existence of a quasi 5-contractible edge in a quasi 5-connected graph
por: Kou, Shuai, et al.
Publicado: (2025)

Improving $R(3,k)$ in just two bites
por: Hefty, Zion, et al.
Publicado: (2025)

Connectoids I: a universal end space theory
por: Bowler, Nathan, et al.
Publicado: (2024)

The path minimises the average size of a connected induced subgraph
por: Haslegrave, John
Publicado: (2021)

Tree-independence number and forbidden induced subgraphs: excluding a $6$-vertex path and a $(2,t)$-biclique
por: Chudnovsky, Maria, et al.
Publicado: (2026)

Restriction on minimum degree in the contractible sets problem
por: Karol, Nikolai
Publicado: (2022)

A forbidden pair for quasi 5-contractible edges
por: Kou, Shuai, et al.
Publicado: (2025)

On g-Extra Connectivity of Corona-Type Graph Products
por: Sharma, Arati, et al.
Publicado: (2025)

On forest and bipartite cuts in sparse graphs
por: Bogdanov, Ilya I., et al.
Publicado: (2025)

A star-comb lemma for finite digraphs
por: Reich, Florian
Publicado: (2024)

Connectoids II: existence of normal trees
por: Bowler, Nathan, et al.
Publicado: (2024)

Highly connected graphs have highly connected spanning bipartite subgraphs
por: Yuster, Raphael
Publicado: (2024)

Stotting in positional games
por: Carmesin, Johannes, et al.
Publicado: (2026)

Sufficient minimum degree conditions for the existence of highly connected or edge-connected subgraphs
por: Krone, Maximilian
Publicado: (2025)

A Cantor-Bernstein-type theorem for spanning trees in infinite graphs
por: Erde, Joshua, et al.
Publicado: (2019)

Real Reliability Roots of Simple Graphs are Dense
por: Omar, Mohamed
Publicado: (2026)

On order-compatible paths in infinite graphs
por: Pitz, Max, et al.
Publicado: (2026)

The connectedness of friends-and-strangers graphs about graph parameters and others
por: Zhao, Xinghui, et al.
Publicado: (2025)