![]()
杨东雷
-
研究员
硕士生导师
- 性别：男
- 毕业院校：山东大学
- 学历：研究生(博士)毕业
- 学位：博士后
- 在职信息：在职
- 所在单位：数学学院
- 入职时间： 2023-08-31
- 学科：运筹学与控制论
- 电子邮箱：dlyang@sdu.edu.cn
访问量：
-
[1]
Ramsey–Dirac theory for bounded degree hypertrees.
Submitted,
-
[2]
Topological cliques in sparse expanders.
Submitted,
-
[3]
Embedding clique subdivisions via crux.
submitted,
-
[4]
Spanning trees in sparse expanders.
Submitted,
-
[5]
Extremal density for subdivisions with length or sparsity constraints.
Submitted,
-
[6]
Balanced clique subdivisions and cycles lengths in Ks,t-free graphs.
Submitted,
-
[7]
Covering the edges of a graph with triangles.
Discrete Math.,
-
[8]
H-factors in graphs with small independence number.
J. Combin. Theory Ser. B,
-
[9]
Compatible Powers of Hamilton Cycles in Dense Graphs.
J. Graph Theory,
2024.
-
[10]
On powers of Hamilton cycles in Ramsey-Turán Theory.
SIAM J. Discret. Math.,
2489 - 2508,
2024.
-
[11]
Transversal Hamilton cycle in hypergraph systems.
SIAM J. Discret. Math.,
2024.
-
[12]
Spanning trees in graphs without large bipartite holes.
Combin. Probab. Comput.,
2023.
-
[13]
GRAPH TILINGS IN INCOMPATIBILITY SYSTEMS.
SIAM J. Discret. Math.,
37,
1930,
2023.
-
[14]
A Ramsey-Turan theory for tilings in graphs.
Random Struct. Algorithms,
2023.
-
[15]
Embedding clique-factors in graphs with low \ell-independence number.
J. Combin. Theory Ser. B,
161,
301-330,
2023.
-
[16]
Clique-factors in graphs with sublinear ℓ-independence number.
Combin. Probab. Comput.,
2023.
-
[17]
Balanced Subdivisions of Cliques in Graphs.
Combinatorica,
43,
885-907,
2023.
-
[18]
Shape of the asymptotic maximum sum-free sets in integer lattice grids.
Eur. J. Comb.,
107,
2023.
-
[19]
Clique immersion in graphs without a fixed bipartite graph.
J. Combin. Theory Ser. B,
157,
346-365,
2022.
-
[20]
Properly colored short cycles in edge-colored graphs.
Eur. J. Comb.,
2022.
