Tao Jiang

From MaRDI portal
Revision as of 10:36, 6 October 2023 by Import231006081045 (talk | contribs) (Created automatically from import231006081045)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:397073

Available identifiers

zbMath Open jiang.tao.1MaRDI QIDQ397073

List of research outcomes





PublicationDate of PublicationType
Rainbow subdivisions of cliques2024-03-25Paper
Bipartite-ness under smooth conditions2023-11-08Paper
Extremal Problems for Hypergraph Blowups of Trees2023-10-26Paper
Linear cycles of consecutive lengths2023-09-19Paper
Tree-Degenerate Graphs and Nested Dependent Random Choice2023-09-06Paper
Negligible Obstructions and Turán Exponents2023-05-15Paper
Rainbow Turán number of clique subdivisions2023-04-27Paper
On Turán exponents of bipartite graphs2023-03-31Paper
Balanced supersaturation and Turan numbers in random graphs2022-08-22Paper
Extremal problems for convex geometric hypergraphs and ordered hypergraphs2022-01-12Paper
Rainbow Tur\'an number of clique subdivisions2021-06-25Paper
Supersaturation of even linear cycles in linear hypergraphs2021-04-30Paper
Tight paths in convex geometric hypergraphs2020-10-20Paper
Partitioning ordered hypergraphs2020-10-07Paper
New bounds for a hypergraph bipartite Turán problem2020-09-07Paper
Hypergraphs not containing a tight tree with a bounded trunk. II: 3-trees with a trunk of size 22020-04-01Paper
Hypergraphs Not Containing a Tight Tree with a Bounded Trunk2019-08-29Paper
Cycles of given lengths in hypergraphs2018-10-11Paper
Lagrangian densities of some sparse hypergraphs and Turán numbers of their extensions2018-08-24Paper
Extremal problems on ordered and convex geometric hypergraphs2018-07-13Paper
On Tur\'an exponents of bipartite graphs2018-06-07Paper
Linear Turán Numbers of Linear Cycles and Cycle-Complete Ramsey Numbers2018-04-23Paper
Stability and Turán Numbers of a Class of Hypergraphs via Lagrangians2017-10-10Paper
Tight paths in convex geometric hypergraphs2017-09-04Paper
On the bandwidth of the Kneser graph2017-06-19Paper
Small Dense Subgraphs of a Graph2017-01-27Paper
Turan numbers of extensions of some sparse hypergraphs via Lagrangians2016-09-28Paper
Tur\'an numbers of hypergraph trees2015-05-12Paper
Exact solution of the hypergraph Turán problem for \(k\)-uniform linear paths2014-08-14Paper
On the co-degree threshold for the Fano plane2014-03-25Paper
Hypergraph Turán numbers of linear cycles2014-01-31Paper
Turán Numbers of Subdivided Graphs2013-01-04Paper
Degree Ramsey numbers for cycles and blowups of trees2012-12-03Paper
Arrangements of \(k\)-sets with intersection constraints2012-09-12Paper
Set Families With a Forbidden Induced Subposet2012-09-04Paper
Near Optimal Bounds for Steiner Trees in the Hypercube2012-02-11Paper
Ramsey numbers of some bipartite graphs versus complete graphs2012-01-24Paper
Set Systems without a Strong Simplex2011-06-17Paper
Compact topological minors in graphs2011-06-07Paper
Anti-Ramsey numbers of doubly edge-critical graphs2009-12-18Paper
Canonical Ramsey numbers and properly colored cycles2009-12-10Paper
Separation numbers of trees2009-09-10Paper
Asymptotic Determination of Edge-Bandwidth of Multidimensional Grids and Hamming Graphs2009-05-27Paper
Edge-bandwidth of the triangular grid2009-04-07Paper
Asymptotic Improvement of the Gilbert–Varshamov Bound on the Size of Binary Codes2008-12-21Paper
A lower bound on the order of regular graphs with given girth pair2007-06-11Paper
https://portal.mardi4nfdi.de/entity/Q34286482007-03-29Paper
https://portal.mardi4nfdi.de/entity/Q57085872005-11-18Paper
https://portal.mardi4nfdi.de/entity/Q54635392005-08-04Paper
https://portal.mardi4nfdi.de/entity/Q54608872005-07-20Paper
On the Steiner, geodetic and hull numbers of graphs2005-06-01Paper
Local Anti-Ramsey Numbers of Graphs2005-03-08Paper
On the Erdős–Simonovits–Sós Conjecture about the Anti-Ramsey Number of a Cycle2005-03-08Paper
Bipartite anti-Ramsey numbers of cycles2005-01-12Paper
A note on a conjecture about cycles with many incident chords2004-08-04Paper
https://portal.mardi4nfdi.de/entity/Q44702322004-06-22Paper
Properly colored subgraphs and rainbow subgraphs in edge‐colorings with local constraints2004-02-03Paper
Edge-colorings of complete graphs that avoid polychromatic trees2004-01-26Paper
Isometric cycles, cutsets, and crowning of bridged graphs2003-07-31Paper
Vertex‐disjoint cycles containing prescribed vertices2003-05-11Paper
Constrained Ramsey numbers of graphs2003-03-19Paper
On a conjecture about trees in graphs with large girth2002-12-10Paper
Anti-Ramsey numbers of subdivided graphs2002-12-10Paper
Planar Hamiltonian chordal graphs are cycle extendable2002-12-02Paper
Edge-colorings with no large polychromatic stars2002-07-29Paper
The chromatic spectrum of mixed hypergraphs2002-07-29Paper
Small odd cycles in 4-chromatic graphs2001-12-16Paper
https://portal.mardi4nfdi.de/entity/Q27413432001-09-23Paper
New upper bounds for a canonical Ramsey problem2000-11-13Paper
Coloring of trees with minimum sum of colors2000-07-05Paper
Perfection thickness of graphs2000-05-07Paper
Edge-Bandwidth of Graphs2000-04-10Paper
https://portal.mardi4nfdi.de/entity/Q42429261999-08-23Paper

Research outcomes over time

This page was built for person: Tao Jiang