Cover Image

The average order of a connected vertex set in $K_m \times P_n$

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Ma, Mingyuan, Ren, Han
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

On the word-representability of $K_m$-$K_n$ graphs
by: Chen, Herman Z. Q., et al.
Published: (2025)

$[k]$-Roman domination on cylindrical grids $C_m \Box P_n$
by: Brezovnik, Simon, et al.
Published: (2026)

Upper bounds for double Roman domination and $[k]$-Roman domination of cylindrical graphs $C_m \Box P_n$
by: Brezovnik, Simon, et al.
Published: (2026)

Further results on \([k]\)-Roman domination on cylindrical grids \(C_m \Box P_n\)
by: Brezovnik, Simon, et al.
Published: (2026)

Intersections of longest cycles in vertex-transitive and highly connected graphs
by: Ma, Jie, et al.
Published: (2025)

Exact results on traces of sets
by: Li, Mingze, et al.
Published: (2024)

The vertex sets of subtrees of a tree
by: Chudnovsky, Maria, et al.
Published: (2025)

Recent advances in arrow relations and traces of sets
by: Li, Mingze, et al.
Published: (2025)

Successive vertex orderings of connected graphs
by: Agrawal, Prarthana, et al.
Published: (2026)

TAR reconfiguration for vertex set parameters
by: Curtis, Bryan A., et al.
Published: (2024)

Edge-disjoint cycles with the same vertex set
by: Chakraborti, Debsoumya, et al.
Published: (2024)

Ramsey numbers of K_s + mK_t versus K_n
by: Dai, Lulu, et al.
Published: (2026)

Feedback vertex sets of digraphs with bounded maximum degree
by: Ai, Jiangdong, et al.
Published: (2025)

Maker-Breaker domination number for Cartesian products of path graphs $P_2$ and $P_n$
by: Forcan, Jovana, et al.
Published: (2020)

On the average size of $1$-nearly independent vertex sets in graphs
by: Dossou-Olory, Audace A. V., et al.
Published: (2025)

Depth of edge ideals and vertex connectivity of finite graphs
by: Hibi, Takayuki, et al.
Published: (2026)

Rational parking functions and $(m, n)$-invariant sets
by: Nelson, Garrett
Published: (2025)

Every 3-connected $\{K_{1,4},K_{1,4}+e\}$-free split graph of order at least 13 is Hamilton-connected
by: Tian, Tao, et al.
Published: (2026)

Finding blowups one vertex at a time
by: Fox, Jacob, et al.
Published: (2026)

Partitioning set $[n] = \{1, \dots, n\}$ into subsets of size at most $m$ such that all sums are powers of $m$
by: Gurvich, Vladimir, et al.
Published: (2025)

On Hamilton paths in vertex-transitive graphs of order $10p$
by: Du, Shaofei, et al.
Published: (2024)

Hamilton cycles in vertex-transitive graphs of order $6p$
by: Du, Shaofei, et al.
Published: (2024)

An averaging result for union-closed families of sets
by: Bouchard, Christopher
Published: (2025)

The number of dissociation sets in connected graphs
by: Yuan, Bo-Jun, et al.
Published: (2024)

A sharp upper bound for the number of connected sets in any grid graph
by: Ma, Hongxia, et al.
Published: (2025)

The codegree Turán density of tight cycles
by: Ma, Jie, et al.
Published: (2025)

Reconfiguration graphs for vertex colorings of $P_5$-free graphs
by: Lei, Hui, et al.
Published: (2024)

The connectivity carcass of a vertex subset in a graph: both odd and even case
by: Baswana, Surender, et al.
Published: (2025)

On the enumeration of connected sets in finite cylindrical lattice graphs
by: Ma, Hongxia, et al.
Published: (2025)

Disjoint connected dominating sets in pseudorandom graphs
by: Draganić, Nemanja, et al.
Published: (2024)

On vertex sets inducing tangles
by: Albrechtsen, Sandra, et al.
Published: (2024)

Improvement on line transversals of families of connected sets in the plane
by: Csizmadia, Miklós
Published: (2025)

Bipartitions with prescribed order of highly connected digraphs
by: Qi, Yuzhen, et al.
Published: (2024)

Induced subdivisions in $K_{s,s}$-free graphs with polynomial average degree
by: Girão, António, et al.
Published: (2023)

Feedback vertex sets of planar digraphs with fixed digirth
by: Dreyer, Simon, et al.
Published: (2026)

The $K_{1,2}$-structure-connectivity of graphs
by: Zhao, Xiao, et al.
Published: (2024)

There are finitely many $5$-vertex-critical $(P_6,\text{bull})$-free graphs
by: Ju, Yiao, et al.
Published: (2025)

On the average hitting times of weighted Cayley graphs
by: Tanaka, Yuuho
Published: (2023)

Characterization of $P_3$-connected graphs
by: Chen, Rong
Published: (2025)

Sublinear hitting sets for some geometric graphs
by: Cheng, Xinbu, et al.
Published: (2024)