Su-yun Jiang

From MaRDI portal
(Redirected from Person:1709413)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
How connectivity affects the extremal number of trees
Journal of Combinatorial Theory. Series B
2024-05-10Paper
Disjoint cycles covering specified vertices in bipartite graphs with partial degrees
Applied Mathematics and Computation
2023-05-31Paper
Partitioning a graph into cycles with a specified number of chords
Journal of Graph Theory
2022-03-31Paper
Vertex-disjoint stars in \(K_{1 , r}\)-free graphs
Discrete Applied Mathematics
2021-08-02Paper
Vertex disjoint copies of \(K_{1 , 4}\) in claw-free graphs
Applied Mathematics and Computation
2021-04-14Paper
Hamiltonicity of edge-chromatic critical graphs
Discrete Mathematics
2020-05-21Paper
Average degrees of edge-chromatic critical graphs
Discrete Mathematics
2019-06-27Paper
Disjoint cliques in claw-free graphs
Acta Mathematicae Applicatae Sinica. English Series
2018-04-05Paper
Partial degree conditions and cycle coverings in bipartite graphs
Graphs and Combinatorics
2017-10-11Paper
Disjoint directed triangles and quadrilaterals in directed graphs2017-07-05Paper
Vertex-disjoint copies of \(K_{1, t}\) in \(K_{1, r}\)-free graphs
Discrete Mathematics
2017-02-06Paper
Vertex-disjoint cycles containing specified vertices in a bipartite graph
Graphs and Combinatorics
2016-11-29Paper
Vertex-disjoint copies of \(K_{1,3}\) in \(K_{1,r}\)-free graphs
Discrete Mathematics
2016-08-16Paper
Graph with any rational density and no rich subsets of linear size
(available as arXiv preprint)
N/APaper
On the maximum number of $r$-cliques in graphs free of complete $r$-partite subgraphs
(available as arXiv preprint)
N/APaper
Generalized Ramsey--Tur\'an density for cliques
(available as arXiv preprint)
N/APaper


Research outcomes over time


This page was built for person: Su-yun Jiang