Tao Jiang

,

,

,

,

SIAM J. Discret. Math., December, 2023

Linear cycles of consecutive lengths.

[BibT_eX]

[DOI]

,

,

Liana Yepremyan

J. Comb. Theory B, November, 2023

Tree-Degenerate Graphs and Nested Dependent Random Choice.

[BibT_eX]

[DOI]

,

Sean Longbrake

SIAM J. Discret. Math., September, 2023

Rainbow Turán number of clique subdivisions.

[BibT_eX]

[DOI]

,

Abhishek Methuku

,

Liana Yepremyan

Eur. J. Comb., May, 2023

Many Turán exponents via subdivisions.

[BibT_eX]

[DOI]

,

Yu Qiu

Comb. Probab. Comput., January, 2023

Bipartite-ness under smooth conditions.

[BibT_eX]

[DOI]

,

Sean Longbrake

,

Comb. Probab. Comput., 2023

On Turán exponents of bipartite graphs.

[BibT_eX]

[DOI]

,

,

Liana Yepremyan

Comb. Probab. Comput., 2022

Partitioning ordered hypergraphs.

[BibT_eX]

[DOI]

,

,

,

,

J. Comb. Theory A, 2021

Turán Numbers of Bipartite Subdivisions.

[BibT_eX]

[DOI]

,

Yu Qiu

SIAM J. Discret. Math., 2020

New bounds for a hypergraph bipartite Turán problem.

[BibT_eX]

[DOI]

Beka Ergemlidze

,

,

Abhishek Methuku

J. Comb. Theory A, 2020

Hypergraphs not containing a tight tree with a bounded trunk II: 3-trees with a trunk of size 2.

[BibT_eX]

[DOI]

,

,

,

,

Discret. Appl. Math., 2020

Hypergraphs Not Containing a Tight Tree with a Bounded Trunk.

[BibT_eX]

[DOI]

,

,

,

,

SIAM J. Discret. Math., 2019

Cycles of given lengths in hypergraphs.

[BibT_eX]

[DOI]

,

J. Comb. Theory B, 2018

Lagrangian densities of some sparse hypergraphs and Turán numbers of their extensions.

[BibT_eX]

[DOI]

,

Yuejian Peng

,

Biao Wu

Eur. J. Comb., 2018

On the bandwidth of the Kneser graph.

[BibT_eX]

[DOI]

,

,

Derrek Yager

Discret. Appl. Math., 2017

Hypergraph Turán numbers of linear cycles.

[BibT_eX]

[DOI]

,

J. Comb. Theory A, 2014

On the co-degree threshold for the Fano plane.

[BibT_eX]

[DOI]

Louis DeBiasio

,

Eur. J. Comb., 2014

Exact solution of the hypergraph Turán problem for k-uniform linear paths.

[BibT_eX]

[DOI]

,

,

Robert Seiver

Comb., 2014

Degree Ramsey numbers for cycles and blowups of trees.

[BibT_eX]

[DOI]

,

Kevin G. Milans

,

Eur. J. Comb., 2013

Turán Numbers of Subdivided Graphs.

[BibT_eX]

[DOI]

,

Robert Seiver

SIAM J. Discret. Math., 2012

Arrangements of k-sets with intersection constraints.

[BibT_eX]

[DOI]

,

Manley Perkel

,

Eur. J. Comb., 2012

Set Families With a Forbidden Induced Subposet.

[BibT_eX]

[DOI]

Edward Boehnlein

,

Comb. Probab. Comput., 2012

Near Optimal Bounds for Steiner Trees in the Hypercube.

[BibT_eX]

[DOI]

,

,

SIAM J. Comput., 2011

Compact topological minors in graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2011

Ramsey Numbers of Some Bipartite Graphs Versus Complete Graphs.

[BibT_eX]

[DOI]

,

Michael Salerno

Graphs Comb., 2011

Set Systems without a Strong Simplex.

[BibT_eX]

[DOI]

,

Oleg Pikhurko

,

Zelealem B. Yilma

SIAM J. Discret. Math., 2010

Separation numbers of trees.

[BibT_eX]

[DOI]

,

,

Theor. Comput. Sci., 2009

Anti-Ramsey numbers of doubly edge-critical graphs.

[BibT_eX]

[DOI]

,

Oleg Pikhurko

J. Graph Theory, 2009

Canonical Ramsey numbers and properly colored cycles.

[BibT_eX]

[DOI]

Discret. Math., 2009

Asymptotic Determination of Edge-Bandwidth of Multidimensional Grids and Hamming Graphs.

[BibT_eX]

[DOI]

Reza Akhtar

,

,

SIAM J. Discret. Math., 2008

Edge-Bandwidth of the Triangular Grid.

[BibT_eX]

[DOI]

Reza Akhtar

,

,

Electron. J. Comb., 2007

On the Steiner, geodetic and hull numbers of graphs.

[BibT_eX]

[DOI]

,

,

,

,

Discret. Math., 2005

Asymptotic Improvement of the Gilbert-Varshamov Bound on the Size of Binary Codes.

[BibT_eX]

[DOI]

,

Alexander Vardy

IEEE Trans. Inf. Theory, 2004

A note on a conjecture about cycles with many incident chords.

[BibT_eX]

[DOI]

J. Graph Theory, 2004

Bipartite anti-Ramsey numbers of cycles.

[BibT_eX]

[DOI]

Maria Axenovich

,

,

André Kündgen

J. Graph Theory, 2004

Anti-Ramsey numbers for small complete bipartite graphs.

[BibT_eX]

Maria Axenovich

,

Ars Comb., 2004

Properly colored subgraphs and rainbow subgraphs in edge-colorings with local constraints.

[BibT_eX]

[DOI]

,

,

,

Random Struct. Algorithms, 2003

Isometric cycles, cutsets, and crowning of bridged graphs.

[BibT_eX]

[DOI]

,

Seog-Jin Kim

,

J. Graph Theory, 2003

Constrained Ramsey numbers of graphs.

[BibT_eX]

[DOI]

Robert E. Jamison

,

,

Alan C. H. Ling

J. Graph Theory, 2003

Vertex-disjoint cycles containing prescribed vertices.

[BibT_eX]

[DOI]

Yoshiyasu Ishigami

,

J. Graph Theory, 2003

On the Erdos-Simonovits-So's Conjecture about the Anti-Ramsey Number of a Cycle.

[BibT_eX]

[DOI]

,

Comb. Probab. Comput., 2003

Local Anti-Ramsey Numbers of Graphs.

[BibT_eX]

[DOI]

Maria Axenovich

,

,

Zsolt Tuza

Comb. Probab. Comput., 2003

Anti-Ramsey Numbers of Subdivided Graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2002

The Chromatic Spectrum of Mixed Hypergraphs.

[BibT_eX]

[DOI]

,

,

,

,

Graphs Comb., 2002

Edge-Colorings with No Large Polychromatic Stars.

[BibT_eX]

[DOI]

Graphs Comb., 2002

Edge-Colorings of Complete Graphs that Avoid Polychromatic Trees.

[BibT_eX]

[DOI]

,

Electron. Notes Discret. Math., 2002

Planar Hamiltonian chordal graphs are cycle extendable.

[BibT_eX]

[DOI]

Discret. Math., 2002

Small odd cycles in 4-chromatic graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2001

On a Conjecture about Trees in Graphs with Large Girth.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2001

Short Even Cycles In Cages With Odd Girth.

[BibT_eX]

Ars Comb., 2001

Correction to Edge-Bandwidth of Graphs.

[BibT_eX]

[DOI]

,

,

,

SIAM J. Discret. Math., 2000

Perfection thickness of graphs.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2000

New Upper Bounds for a Canonical Ramsey Problem.

[BibT_eX]

[DOI]

,

Comb., 2000

Edge-Bandwidth of Graphs.

[BibT_eX]

[DOI]

,

,

,

SIAM J. Discret. Math., 1999

Coloring of trees with minimum sum of colors.

[BibT_eX]

[DOI]

,

J. Graph Theory, 1999

Chromatic spectrum is broken.

[BibT_eX]

[DOI]

,

,

,

,

Electron. Notes Discret. Math., 1999

Connectivity and separating sets of cages.

[BibT_eX]

[DOI]

,