16 papers · 1 filter
Intersecting families with covering number three II
Peter Frankl, Jian Wang
A family is called intersecting if for all . The covering number of a family is defi…
A stability result for -free graphs
Sijie Ren, Jian Wang, Shipeng Wang +1
A graph is called -free if it does not contain any cycle of length . In 1981, Haggkvist, Faudree and Schelp showed that every -vertex triangle-free graph wit…
Improved bounds concerning the maximum degree of intersecting hypergraphs
Peter Frankl, Jian Wang
For positive integers let denote the collection of all -subsets of the standard -element set . Subsets of are ca…
Counterexamples to Gerbner's Conjecture on Stability of Maximal -free Graphs
Jian Wang, Shipeng Wang, Weihua Yang
Let be an -color critical graph with , that is, and there is an edge in such that . Gerbner recently conjectured that every -ver…
Intersections and Distinct Intersections in Cross-intersecting Families
Peter Frankl, Jian Wang
Let be two cross-intersecting families of -subsets of . Let , d…
On the sum of sizes of overlapping families
Peter Frankl, Jian Wang
Let be families of -subsets of an -set. Suppose that one cannot choose pairwise disjoint edges from distinct families. Subject to t…