Jie Wang

activity

20242026

collaborators

Showing math.COShow all

5 papers · 1 filter

math.CO2025

A lower bound theorem for $d$ -polytopes with at most $3 d - 1$ vertices

Guillermo Pineda-Villavicencio, Jie Wang

We prove a lower bound theorem for the number of $k$ -faces ( $1 \leq k \leq d - 2$ ) in a $d$ -dimensional polytope $P$ (or $d$ -polytope) with up to $3 d - 1$ vertices. Previous lower bound th…

math.CO2025

A refined lower bound theorem for $d$ -polytopes with at most $2 d$ vertices

Guillermo Pineda-Villavicencio, Jie Wang, David Yost

In 1967, Grünbaum conjectured that the function $ϕ_{k} (d + s, d) := (k + 1 d + 1) + (k + 1 d) - (k + 1 d + 1 - s), for 2 \leq s \leq d$ provides the minimum number of $k$ -…

math.CO2024

A lower bound theorem for $d$ -polytopes with $2 d + 2$ vertices

Guillermo Pineda-Villavicencio, Aholiab Tritama, Jie Wang +1

We establish a lower bound theorem for the number of $k$ -faces ( $1 \leq k \leq d - 2$ ) in a $d$ -dimensional polytope $P$ (abbreviated as a $d$ -polytope) with $2 d + 2$ vertices, extending t…

math.CO2024

A Fan-type condition for cycles in $1$ -tough and $k$ -connected $(P_{2} \cup k P_{1})$ -free graphs

Zhiquan Hu, Jie Wang, Changlong Shen

For a graph $G$ , let $μ_{k} (G) := min {max_{x \in S} d_{G} (x) : S \in S_{k}}$ , where $S_{k}$ is the set consisting of all independent sets ${u_{1}, \dots, u_{k}}$ of $G$ suc…

math.CO2024

Polytopes with low excess degree

Guillermo Pineda-Villavicencio, Jie Wang, David Yost

We study the existence and structure of $d$ -polytopes for which the number $f_{1}$ of edges is small compared to the number $f_{0}$ of vertices. Our results are more elegantly expresse…

A lower bound theorem for d-polytopes with at most 3d−1 vertices

A refined lower bound theorem for d-polytopes with at most 2d vertices

A lower bound theorem for d-polytopes with 2d+2 vertices

A Fan-type condition for cycles in 1-tough and k-connected (P2​∪kP1​)-free graphs

Polytopes with low excess degree

A lower bound theorem for $d$ -polytopes with at most $3 d - 1$ vertices

A refined lower bound theorem for $d$ -polytopes with at most $2 d$ vertices

A lower bound theorem for $d$ -polytopes with $2 d + 2$ vertices

A Fan-type condition for cycles in $1$ -tough and $k$ -connected $(P_{2} \cup k P_{1})$ -free graphs