7 papers
Sharp bounds on -wise generalizations of oddtowns and eventowns
Zichao Dong, Minghui Ouyang, Lan Wei
For , an -town is a set family in which every -wise intersection has parity . Denote by $f_{\boldsym…
VC-dimensions Between Partially Ordered Sets and Totally Ordered Sets
Boyan Duan, Minghui Ouyang, Zheng Wang
We say that two partial orders on are compatible if there exists a partial order that refines both of them. This compatibility relation induces a natural set system structure…
Set families: restricted distances via restricted intersections
Zichao Dong, Jun Gao, Hong Liu +2
Denote by the maximum size of a set family on $[n] \stackrel{\mbox{\normalfont\tiny def}}{=} \{1, \dots, n\}$ with distance set . That is, $|A \bigtriangl…
On Relative Ordered Turán Density
Dylan King, Bernard Lidický, Minghui Ouyang +3
For an ordered graph , denote the Turán density by . The relative Turán density, denoted by , is the supremum over such that every ordered grap…
Multicolor ErdÅs--Rogers Functions
Hong Liu, Haoran Luo, Minghui Ouyang
In this paper, we study a multicolor variant of ErdÅs--Rogers functions. Let be the largest integer such that there is always an induce…
Property O and ErdÅs--Szekeres properties in linear hypergraphs
Suyun Jiang, Ander Lamaison, Minghui Ouyang
An oriented -uniform hypergraph, or oriented -graph, is said to satisfy Property O if, for every linear ordering of its vertex set, there is some edge oriented consistently w…