The following pages link to Wei-Tian Li (Q396869):
Displayed 23 items.
- Intersecting \(k\)-uniform families containing all the \(k\)-subsets of a given set (Q396872) (← links)
- Diamond-free families (Q654889) (← links)
- Families of subsets without a given poset in double chains and Boolean lattices (Q722595) (← links)
- The partition method for poset-free families (Q1956245) (← links)
- Shifted-antimagic labelings for graphs (Q2045398) (← links)
- Antimagic labeling of forests with sets of consecutive integers (Q2065767) (← links)
- Rainbow Ramsey problems for the Boolean lattice (Q2088071) (← links)
- The Boolean rainbow Ramsey number of antichains, Boolean posets and chains (Q2213816) (← links)
- Some remarks on nestings in the normalized matching posets of rank 3 (Q2279681) (← links)
- Poset-free families and Lubell-boundedness (Q2347975) (← links)
- A note on the largest size of families of sets with a forbidden poset (Q2454051) (← links)
- Progress on poset-free families of subsets (Q2957186) (← links)
- Routing Numbers of Cycles, Complete Bipartite Graphs, and Hypercubes (Q3013141) (← links)
- The Strongly Antimagic labelings of Double Spiders (Q5156335) (← links)
- Labeling trees of small diameters with consecutive integers (Q6110572) (← links)
- The Asymptotic Bound of the Lubell Function for Diamond-free Families (Q6233471) (← links)
- A Common Generalization of the Theorems of Erd\H{o}s-Ko-Rado and Hilton-Milner (Q6240949) (← links)
- Families of Subsets Without a Given Poset in the Interval Chains (Q6273081) (← links)
- Some Sufficient Conditions for Finding a Nesting of the Normalized Matching Posets of Rank 3 (Q6290942) (← links)
- Rainbow Ramsey problems for the Boolean lattice (Q6307138) (← links)
- The antimagic orientation problems for graphs obtained by some graph operations (Q6356411) (← links)
- Ramsey Properties for $V$-shaped Posets in the Boolean Lattices (Q6375493) (← links)
- On $k$-Shifted Antimagic Spider Forests (Q6386765) (← links)