Maryam Sharifzadeh

Electron. J. Comb., 2024

2023

The induced saturation problem for posets.

[BibT_eX]

[DOI]

Comb. Theory, 2023

2021

Groups with few maximal sum-free sets.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2021

On the Maximum Number of Integer Colourings with Forbidden Monochromatic Sums.

[BibT_eX]

[DOI]

Katherine Staden

Electron. J. Comb., 2021

2020

Characterization of quasirandom permutations by a pattern sum.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2020

2019

Edges not in any monochromatic copy of a fixed graph.

[BibT_eX]

[DOI]

Oleg Pikhurko

J. Comb. Theory B, 2019

Structure and Supersaturation for Intersecting Families.

[BibT_eX]

[DOI]

Electron. J. Comb., 2019

2017

On Two Problems in Ramsey-Turán Theory.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2017

Proof of Komlós's conjecture on Hamiltonian subsets.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2017

Local Conditions for Exponentially Many Subdivisions.

[BibT_eX]

[DOI]

Katherine Staden

Comb. Probab. Comput., 2017

The typical structure of graphs with no large cliques.

[BibT_eX]

[DOI]

Neal Bushaw

Maurício Collares Neto

Robert Morris

Comb., 2017

2016

Triangle factors of graphs without large independent sets and of weighted graphs.

[BibT_eX]

[DOI]

Theodore Molla

Random Struct. Algorithms, 2016

2015

Subdivisions of a large clique in C6-free graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2015

Intersecting families of discrete structures are typically trivial.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2015

A sharp bound on the number of maximal sum-free sets.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2015

A characterization of P5-free graphs with a homeomorphically irreducible spanning tree.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2015

2012

The Iranian Wheat Growers' Climate Information Use: An Actor-Network Theory Perspective.

[BibT_eX]

[DOI]