7 papers · 1 filter
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_{\boldsymbolα}…
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 graph …
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 induced…
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…
Set families: restricted distances via restricted intersections
Zichao Dong, Jun Gao, Hong Liu +2
Denote by the maximum size of a set family on with distance set . That is, holds for every pair of di…
On restricted sumsets with bounded degree relations
Minghui Ouyang
Given two subsets and a binary relation , the restricted sumset of with respect to is defined a…