researcher

Kaishun Wang

84 papers hereh-index 231.7k citations166 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position

middle author14
last author70

Across the 84 of 84 papers where every author was matched, so the position is known.

fields

math.CO78
math.GR5
math.AG1

same name

Kaishun Wang — 1 paper

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity

20092026

most citedWeakly distance-regular digraphs of valency three, I

8 citations · 52 across the 81 of their papers we have counts for

collaborators

Showing 2025Show all

2 papers · 1 filter

math.CO2025

$s$ -almost cross- $t$ -intersecting families for finite sets

Dehai Liu, Kaishun Wang, Tian Yao

Two families $F$ and $G$ of $k$ -subsets of an $n$ -set are called $s$ -almost cross- $t$ -intersecting if each member in $F$ (resp. $G$ ) is $t$ -…

math.CO2025

Semicomplete multipartite weakly distance-regular digraphs

Shuang Li, Yuefeng Yang, Kaishun Wang

A digraph is semicomplete multipartite if its underlying graph is a complete multipartite graph. As a special case of semicomplete multipartite digraphs, Jørgensen et al. \cite{JG1…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore

Search
Researchers
Institutions

Account

Library
Chat

Data

arXiv.org
Semantic Scholar
OpenAlex
Latest RSS

About Contact Privacy Developers llms.txt openapi.json

Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.

s-almost cross-t-intersecting families for finite sets

Semicomplete multipartite weakly distance-regular digraphs

$s$ -almost cross- $t$ -intersecting families for finite sets