Ligong Wang

collaborators

4 papers

math.CO2024

A sharp upper bound on the spectral radius of $θ (1, 3, 3)$ -free graphs with given size

Yuxiang Liu, Ligong Wang

A graph $G$ is $F$ -free if $G$ does not contain $F$ as a subgraph. Let $ρ (G)$ be the spectral radius of a graph $G$ . Let $θ (1, p, q)$ denote the theta graph, which is obtained by con…

math.CO2024

Connected Turán numbers for Berge paths in hypergraphs

Lin-Peng Zhang, Hajo Broersma, Ervin Győri +2

Let $F$ be a family of $r$ -uniform hypergraphs. Denote by $\ex^{\mathrm{conn}}_r(n,\mathcal{F})$ the maximum number of hyperedges in an $n$ -vertex connected $r$ -uniform h…

math.CO2024

A note on generalized crowns in linear r-graphs

Lin-Peng Zhang, Hajo Broersma, Ligong Wang

An $r$ -graph $H$ is a hypergraph consisting of a nonempty set of vertices $V$ and a collection of $r$ -element subsets of $V$ we refer to as the edges of $H$ . An $r$ -graph $H$ is ca…

math.CO2023

Distance spectral conditions for $I D$ -factor-critical and fractional $[a, b]$ -factor of graphs

Tingyan Ma, Ligong Wang

Let $G = (V (G), E (G))$ be a graph with vertex set $V (G)$ and edge set $E (G)$ . A graph is $I D$ -factor-critical if for every independent set $I$ of $G$ whose size has the same parity a…

A sharp upper bound on the spectral radius of θ(1,3,3)-free graphs with given size

Connected Turán numbers for Berge paths in hypergraphs

A note on generalized crowns in linear r-graphs

Distance spectral conditions for ID-factor-critical and fractional [a,b]-factor of graphs

A sharp upper bound on the spectral radius of $θ (1, 3, 3)$ -free graphs with given size

Distance spectral conditions for $I D$ -factor-critical and fractional $[a, b]$ -factor of graphs