The following pages link to Tao Jiang (Q397073):
Displaying 50 items.
- Exact solution of the hypergraph Turán problem for \(k\)-uniform linear paths (Q397075) (← links)
- (Q449215) (redirect page) (← links)
- Arrangements of \(k\)-sets with intersection constraints (Q449216) (← links)
- Ramsey numbers of some bipartite graphs versus complete graphs (Q659665) (← links)
- Degree Ramsey numbers for cycles and blowups of trees (Q691593) (← links)
- Separation numbers of trees (Q837168) (← links)
- Edge-bandwidth of the triangular grid (Q1010627) (← links)
- Canonical Ramsey numbers and properly colored cycles (Q1043941) (← links)
- Edge-colorings of complete graphs that avoid polychromatic trees (Q1421517) (← links)
- New upper bounds for a canonical Ramsey problem (Q1586336) (← links)
- Edge-colorings with no large polychromatic stars (Q1606032) (← links)
- The chromatic spectrum of mixed hypergraphs (Q1606033) (← links)
- Lagrangian densities of some sparse hypergraphs and Turán numbers of their extensions (Q1663794) (← links)
- On the Steiner, geodetic and hull numbers of graphs (Q1779492) (← links)
- Cycles of given lengths in hypergraphs (Q1791703) (← links)
- Planar Hamiltonian chordal graphs are cycle extendable (Q1850025) (← links)
- On a conjecture about trees in graphs with large girth (Q1850563) (← links)
- Anti-Ramsey numbers of subdivided graphs (Q1850619) (← links)
- Perfection thickness of graphs (Q1974539) (← links)
- Partitioning ordered hypergraphs (Q2005178) (← links)
- New bounds for a hypergraph bipartite Turán problem (Q2194765) (← links)
- Hypergraphs not containing a tight tree with a bounded trunk. II: 3-trees with a trunk of size 2 (Q2309552) (← links)
- On the bandwidth of the Kneser graph (Q2357135) (← links)
- Hypergraph Turán numbers of linear cycles (Q2434896) (← links)
- On the co-degree threshold for the Fano plane (Q2441623) (← links)
- Rainbow Turán number of clique subdivisions (Q2700979) (← links)
- (Q2741343) (← links)
- Small odd cycles in 4-chromatic graphs (Q2744571) (← links)
- Set Families With a Forbidden Induced Subposet (Q2908124) (← links)
- Small Dense Subgraphs of a Graph (Q2957688) (← links)
- Compact topological minors in graphs (Q3005115) (← links)
- Set Systems without a Strong Simplex (Q3008025) (← links)
- Near Optimal Bounds for Steiner Trees in the Hypercube (Q3115870) (← links)
- Bipartite anti-Ramsey numbers of cycles (Q3156920) (← links)
- (Q3428648) (← links)
- A lower bound on the order of regular graphs with given girth pair (Q3445509) (← links)
- Asymptotic Improvement of the Gilbert–Varshamov Bound on the Size of Binary Codes (Q3547075) (← links)
- Asymptotic Determination of Edge-Bandwidth of Multidimensional Grids and Hamming Graphs (Q3629454) (← links)
- Anti-Ramsey numbers of doubly edge-critical graphs (Q3652531) (← links)
- (Q4242926) (← links)
- Isometric cycles, cutsets, and crowning of bridged graphs (Q4416301) (← links)
- Properly colored subgraphs and rainbow subgraphs in edge‐colorings with local constraints (Q4446871) (← links)
- (Q4470232) (← links)
- A note on a conjecture about cycles with many incident chords (Q4474282) (← links)
- Linear Turán Numbers of Linear Cycles and Cycle-Complete Ramsey Numbers (Q4635508) (← links)
- Local Anti-Ramsey Numbers of Graphs (Q4655896) (← links)
- On the Erdős–Simonovits–Sós Conjecture about the Anti-Ramsey Number of a Cycle (Q4655902) (← links)
- Edge-Bandwidth of Graphs (Q4699159) (← links)
- Coloring of trees with minimum sum of colors (Q4719325) (← links)
- Constrained Ramsey numbers of graphs (Q4798124) (← links)
