Yi-Ting Jiang

1 citations · 1 across the 4 of their papers we have counts for

collaborators

4 papers

math.CO2024

Degree-truncated choosability of planar graphs

Yiting Jiang, Huijuan Xu, Xinbo Xu +1

Assume $G$ is a graph and $k$ is a positive integer. Let $f : V (G) \to N$ be defined as $f (v) = min {k, d_{G} (v)}$ . If $G$ is $f$ -choosable, then we say $G$ is degree-truncated…

math.CO2021

Minimal asymmetric hypergraphs

Yiting Jiang, Jaroslav Nesetril

In this paper, we prove that for any $k \geq 3$ , there exist infinitely many minimal asymmetric $k$ -uniform hypergraphs. This is in a striking contrast to $k = 2$ , where it has been pr…

math.CO2021

On asymmetric hypergraphs

Yiting Jiang, Jaroslav Nešetřil

In this paper, we prove that for any $k \geq 3$ , there exist infinitely many minimal asymmetric $k$ -uniform hypergraphs. This is in a striking contrast to $k = 2$ , where it has been pr…

cs.DM2021★ 1 cited

Discrepancy and Sparsity

Mario Grobler, Yiting Jiang, Patrice Ossona de Mendez +2

We study the connections between the notions of combinatorial discrepancy and graph degeneracy. In particular, we prove that the maximum discrepancy over all subgraphs $H$ of a gra…