From the 1 of 7 linked papers with an AI index.
7 papers
Extremal Families for the ErdÅs--Kleitman Problem: The Missing Constructions
Cheng Chi, Yan Wang
The paper identifies new extremal families for the Erdős–Kleitman problem by analyzing weighted constructions and confirms the Frankl–Kupavskii meta‑conjecture in many parameter ra…
Perfect matching in 4-partite 4-uniform hypergraphs
Hongliang Lu, Yan Wang, Feihong Yuan
A balanced -partite -graph is a -uniform hypergraph such that every edge intersects each partition class in exactly one vertex, where each partition class has size . Lo…
New Extremal Ranges and Constructions of the ErdÅs--Kleitman Problem
Cheng Chi, Yan Wang
For integers , let denote the maximum size of a family with no pairwise disjoint members. The problem of determining ,…
Proofs of Two Conjectures of Alon on Subgraph Counts
Peiru Kuang, Shuang Sun, Yan Wang +1
All graphs considered are finite with no isolated vertices. Let be the maximum number of subgraphs of a graph isomorphic to , taken over all graphs with edg…
Induced subdivisions in graphs of large girth
Peiru Kuang, Yan Wang
In this paper, we prove that there exists an absolute constant such that, for every integer , every graph with and contains an induced…
Graphs with girth 8 and without longer even holes are 3-colorable
Yan Wang, Rong Wu
For an integer , let denote the family of graphs which have girth and have no even hole of length greater than . Wu, Xu and Xu conject…