Yan Wang

From MaRDI portal
(Redirected from Yan Wang)
Yan Wang Q501986



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
An explicit third-order low-regularity integrator for the cubic nonlinear Schrödinger equation
(available as arXiv preprint)
2026-10-26Paper
On stability of rainbow matchings
Combinatorics, Probability and Computing
2026-07-24Paper
Nearly tight bound for rainbow clique subdivisions in properly edge-colored graphs and applications
(available as arXiv preprint)
2026-01-01Paper
A quadratic-time coloring algorithm for graphs with large maximum degree
(available as arXiv preprint)
2026-01-01Paper
On the structures of {diamond, bowtie}-free graphs that do not contain an induced subdivision of $K_4$
(available as arXiv preprint)
2026-01-01Paper
On the (k+2,k)-problem of Brown, Erdős and Sós for even integers k
(available as arXiv preprint)
2026-01-01Paper
A local Turán inequality for walks and the spectral radius
(available as arXiv preprint)
2026-01-01Paper
A solution to Frankl and Kupavskii's conjecture concerning Erdős-Kleitman matching problem
(available as arXiv preprint)
2026-01-01Paper
Towards the Erdős--Kleitman Problem: from Erdős matching conjecture perspective
(available as arXiv preprint)
2026-01-01Paper
Induced subdivisions in graphs of large girth
(available as arXiv preprint)
2026-01-01Paper
Graphs with girth 8 and without longer even holes are 3-colorable
(available as arXiv preprint)
2026-01-01Paper
Tight Bound for Nikiforov's Spectral Even-Cycle Conjecture
(available as arXiv preprint)
2026-01-01Paper
A Single-Exponential Erdős--Hajnal Bound for Graphs of Bounded VC-Dimension
(available as arXiv preprint)
2026-01-01Paper
Perfect matching in 4-partite 4-uniform hypergraphs
(available as arXiv preprint)
2026-01-01Paper
Solutions to Two Problems of Sárközy and Sós on Additive Representation Functions
(available as arXiv preprint)
2026-01-01Paper
Compactness of abundance in asymmetric hypergraph removal lemmas
(available as arXiv preprint)
2026-01-01Paper
Optimal coloring of $\{\mathrm{cap},\mathrm{even\ hole}\}$-free graphs with no short odd holes
(available as arXiv preprint)
2026-01-01Paper
Extremal Families for the Erdős--Kleitman Problem: The Missing Constructions
(available as arXiv preprint)
2026-01-01Paper
An Optimal Bound for Ramsey Goodness of Cycles
(available as arXiv preprint)
2026-01-01Paper
Covering the ternary cube by binary subcubes
(available as arXiv preprint)
2026-01-01Paper
Every fork-free graph is perfectly weight divisible
(available as arXiv preprint)
2026-01-01Paper
A local clique density theorem in H-free graphs
(available as arXiv preprint)
2026-01-01Paper
An improved bound on the minimum size of Turán (r+1,r)-systems
(available as arXiv preprint)
2026-01-01Paper
A Phase Transition for Small Dense Subhypergraphs
(available as arXiv preprint)
2026-01-01Paper
The quadratic Brown--Erdős--Sós problem for 3-uniform hypergraphs with 8 and 9 edges
(available as arXiv preprint)
2026-01-01Paper
A Proof of the Erdős Matching Conjecture for Large Matchings via Sharp Tail Probability for Sums of i.i.d. Nonnegative Random Variables
(available as arXiv preprint)
2026-01-01Paper
Graham's rearrangement conjecture in finite abelian groups
(available as arXiv preprint)
2026-01-01Paper
Path decompositions of Eulerian graphs
Discrete Mathematics
2025-12-15Paper
Vertex degree sums for perfect matchings in 3-uniform hypergraphs
Discrete Mathematics
2025-06-11Paper
Improved bound for Hadwiger's conjecture
Graphs and Combinatorics
2025-03-18Paper
Vertex degree sums for rainbow matchings in 3-uniform hypergraphs
(available as arXiv preprint)
2025-01-01Paper
Generalized Turan number with given size
(available as arXiv preprint)
2025-01-01Paper
Optimal χ-boundness of \ell-holed graphs
(available as arXiv preprint)
2025-01-01Paper
On the number of triangles in K₄-free graphs
(available as arXiv preprint)
2025-01-01Paper
Tight bounds for judicious 3-partitions of graphs
(available as arXiv preprint)
2025-01-01Paper
Graphs with girth 9 and without longer odd holes are 3-colourable
Journal of Graph Theory
2024-07-02Paper
Graph partitions under average degree constraint
Journal of Combinatorial Theory. Series B
2024-01-15Paper
Rainbow perfect matchings in 3-partite 3-uniform hypergraphs
(available as arXiv preprint)
2024-01-01Paper
Partition subcubic planar graphs into independent sets
(available as arXiv preprint)
2024-01-01Paper
Co-degree threshold for rainbow perfect matchings in uniform hypergraphs
Journal of Combinatorial Theory. Series B
2023-09-19Paper
Balanced Subdivisions of a Large Clique in Graphs with High Average Degree
SIAM Journal on Discrete Mathematics
2023-06-27Paper
On stability of rainbow matchings2023-02-13Paper
A better bound on the size of rainbow matchings
Journal of Combinatorial Theory. Series A
2023-01-04Paper
On stability of rainbow matchings
(available as arXiv preprint)
2023-01-01Paper
Rainbow perfect matchings for 4-uniform hypergraphs
SIAM Journal on Discrete Mathematics
2022-07-28Paper
The Kelmans-Seymour conjecture. I: Special separations
Journal of Combinatorial Theory. Series B
2020-07-07Paper
The Kelmans-Seymour conjecture. II: 2-vertices in \(K_4^-\)
Journal of Combinatorial Theory. Series B
2020-07-07Paper
The Kelmans-Seymour conjecture. III: 3-vertices in \(K_4^-\)
Journal of Combinatorial Theory. Series B
2020-07-07Paper
The Kelmans-Seymour conjecture. IV: A proof
Journal of Combinatorial Theory. Series B
2020-07-07Paper
7-connected graphs are 4-ordered
Journal of Combinatorial Theory. Series B
2020-01-15Paper
Minimum codegree condition for perfect matchings in k‐partite k‐graphs
Journal of Graph Theory
2019-12-30Paper
Almost perfect matchings in \(k\)-partite \(k\)-graphs
SIAM Journal on Discrete Mathematics
2018-02-22Paper
Induced forests in bipartite planar graphs
Journal of Combinatorics
2017-01-10Paper
The Kelmans-Seymour conjecture IV: a proof
(available as arXiv preprint)
2016-01-01Paper
The Kelmans-Seymour conjecture I: special separations
(available as arXiv preprint)
2015-01-01Paper


Research outcomes over time


This page was built for person: Yan Wang