1 citations · 1 across the 4 of their papers we have counts for
Showing math.COShow all
3 papers · 1 filter
math.CO2024
Degree-truncated choosability of planar graphs
Yiting Jiang, Huijuan Xu, Xinbo Xu +1
Assume is a graph and is a positive integer. Let be defined as . If is -choosable, then we say is degree-truncated…
math.CO2021
Minimal asymmetric hypergraphs
Yiting Jiang, Jaroslav Nesetril
In this paper, we prove that for any , there exist infinitely many minimal asymmetric -uniform hypergraphs. This is in a striking contrast to , where it has been pr…
math.CO2021
On asymmetric hypergraphs
Yiting Jiang, Jaroslav Nešetřil
In this paper, we prove that for any , there exist infinitely many minimal asymmetric -uniform hypergraphs. This is in a striking contrast to , where it has been pr…