Cover Image

Chvátal-Erdős condition for 2-factors with at most two components in graphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Tian, Tao, Xiong, Liming, Yan, Weigen
Format:	Preprint
Published:	2026
Subjects:	Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A generalization of the Chvátal-Erdős theorem
by: Cheng, Kun
Published: (2025)

Improved lower bound towards Chen-Chvátal conjecture
by: Huang, Congkai
Published: (2023)

Extensions of Erdős's 1962 theorem on non-Hamiltonian graphs
by: Liu, Xu, et al.
Published: (2026)

Some sufficient conditions for graphs to have component factors
by: Zhou, Sizhong
Published: (2024)

The process of fluctuations of the giant component of an Erdős-Rényi graph
by: Enriquez, Nathanaël, et al.
Published: (2023)

Chen-Chvátal Conjecture for Graphs of Diameter 3
by: Matamala, Martín, et al.
Published: (2025)

The intersection of a random geometric graph with an Erdős-Rényi graph
by: Bennett, Patrick, et al.
Published: (2024)

Towards the Erdős--Kleitman Problem: from Erdős matching conjecture perspective
by: Chi, Cheng, et al.
Published: (2026)

Existence of most reliable two-terminal graphs with distance constraints
by: Romero, Pablo
Published: (2025)

Spectral conditions for factor-criticality of graphs
by: Cai, Jin, et al.
Published: (2024)

Generalised Erdős distance theory on graphs
by: Dewar, Sean, et al.
Published: (2025)

Fractional factors and component factors in graphs with isolated toughness smaller than 1
by: Wolf, Isaak H.
Published: (2023)

The Chvátal-Sankoff problem: Understanding random string comparison through stochastic processes
by: Tiskin, Alexander
Published: (2022)

Existence, uniqueness and construction of locally most reliable two-terminal graphs
by: Romero, Pablo
Published: (2025)

Spectral conditions for graphs to contain $k$-factors
by: Tang, Xinying, et al.
Published: (2025)

An Erdős-Stone type result for high-order spectra of graphs
by: Liu, Chunmeng, et al.
Published: (2023)

Improved Erdős-Pósa inequalities for odd cycles in planar graphs
by: Puhlmann, Luise, et al.
Published: (2025)

A characterization of graphs of radius-$r$ flip-width at most $2$
by: Chang, Yeonsu, et al.
Published: (2023)

The Erdős-Pósa property for infinite graphs
by: Krill, Thilo
Published: (2024)

Color-avoiding percolation on the Erdős-Rényi random graph
by: Lichev, Lyuben, et al.
Published: (2022)

Erdős-Pósa property of tripods in directed graphs
by: Briański, Marcin, et al.
Published: (2024)

Size conditions and spectral conditions for generalized factor-critical (bicritical) graphs and $k$-$d$-critical graphs
by: Zhang, Zhenhao, et al.
Published: (2026)

Packing chromatic critical graphs with radius at most 2
by: Gür, Aslıhan, et al.
Published: (2026)

$K_{2,3}$-induced minor-free graphs admit quasi-isometry with additive distortion to graphs of tree-width at most two
by: Chakraborty, Dibyayan
Published: (2025)

The existence of even factors based on spectral conditions of graphs
by: Li, Jiasheng, et al.
Published: (2025)

Spectral condition for $k$-factor-criticality in $t$-connected graphs
by: Ma, Tingyan, et al.
Published: (2025)

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

Erdős-Pósa property of $A$-paths in unoriented group-labelled graphs
by: Kwon, O-joung, et al.
Published: (2024)

On a question of Erdős and Nešetřil about minimal cuts in a graph
by: Bradač, Domagoj
Published: (2024)

The critical Karp--Sipser core of Erdős--Rényi random graphs
by: Budzinski, Thomas, et al.
Published: (2024)

Forbidden subgraphs in divisor graphs and an Erdős divisibility problem
by: Davis, Damek
Published: (2026)

Sandwiching between random regular graphs and Erdős-Rényi graphs: configuration model and unions of perfect matchings
by: Gao, Pu, et al.
Published: (2025)

Words avoiding the morphic images of most of their factors
by: Ochem, Pascal, et al.
Published: (2025)

On the $(k+2,k)$-problem of Brown, Erdős and Sós for even integers $k$
by: Wang, Yan, et al.
Published: (2026)

Strong list-chromatic index of subcubic graphs is at most 10
by: Tang, Yunfang, et al.
Published: (2025)

On spectral conditions for fractional $k$-extendable graphs
by: Bai, Xiyan, et al.
Published: (2026)

Every 2-connected, cubic, planar graph with faces of size at most 6 is Hamiltonian
by: Shao, Sihong, et al.
Published: (2025)

Ramanujan graphs with diameter at most three
by: Ebrahimi, Mahdi
Published: (2024)

Anticoncentration in Ramsey graphs and a proof of the Erdős-McKay conjecture
by: Kwan, Matthew, et al.
Published: (2022)

Connectivity keeping trees in 3-connected bipartite graphs with girth conditions
by: Yang, Qing, et al.
Published: (2023)