David J. Galvin

Cliff Smyth

Australas. J Comb., June, 2024

On the zeroes of hypergraph independence polynomials.

[BibT_eX]

[DOI]

Comb. Probab. Comput., January, 2024

Generalized Tuza's Conjecture for Random Hypergraphs.

[BibT_eX]

[DOI]

Abdul Basit

SIAM J. Discret. Math., 2024

2022

Independent set and matching permutations.

[BibT_eX]

[DOI]

J. Graph Theory, 2022

2021

On the Independent Set Sequence of a Tree.

[BibT_eX]

[DOI]

Abdul Basit

Electron. J. Comb., 2021

2020

A risk calculator to inform the need for a prostate biopsy: a rapid access clinic cohort.

[BibT_eX]

[DOI]

Thomas Brendan Murphy

R. William G. Watson

BMC Medical Informatics Decis. Mak., 2020

Total non-negativity of some combinatorial matrices.

[BibT_eX]

[DOI]

Adrian Pacurar

J. Comb. Theory A, 2020

2019

Restricted Stirling and Lah number matrices and their inverses.

[BibT_eX]

[DOI]

Cliff Smyth

J. Comb. Theory A, 2019

Phase Coexistence for the Hard-Core Model on ℤ2.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2019

The Game of Plates and Olives.

[BibT_eX]

[DOI]

Teena Carroll

Electron. J. Comb., 2019

2017

Extremal H-colorings of trees and 2-connected graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2017

2016

Special Issue: APPROX-RANDOM 2014: Guest Editors' Foreword.

[BibT_eX]

[DOI]

Deeparnab Chakrabarty

Theory Comput., 2016

Asymptotic Normality of Some Graph Sequences.

[BibT_eX]

[DOI]

Graphs Comb., 2016

On the independence ratio of distance graphs.

[BibT_eX]

[DOI]

Discret. Math., 2016

Cutting lemma and Zarankiewicz's problem in distal structures.

[BibT_eX]

[DOI]

Artem Chernikov

Sergei Starchenko

CoRR, 2016

Phase Coexistence for the Hard-Core Model on ${\mathbb Z}^2$.

[BibT_eX]

[DOI]

CoRR, 2016

2015

Phase coexistence and torpid mixing in the 3-coloring model on ℤ<sup>d</sup>.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2015

Counting Colorings of a Regular Graph.

[BibT_eX]

[DOI]

Graphs Comb., 2015

Combinatorially interpreting generalized Stirling numbers.

[BibT_eX]

[DOI]

Justin Hilyard

Eur. J. Comb., 2015

2014

Counting Independent Sets of a Fixed Size in Graphs with a Given Minimum Degree.

[BibT_eX]

[DOI]

J. Graph Theory, 2014

2013

Maximizing <i>H</i>-Colorings of a Regular Graph.

[BibT_eX]

[DOI]

J. Graph Theory, 2013

Stirling Numbers of Forests and Cycles.

[BibT_eX]

[DOI]

Do Trong Thanh

Electron. J. Comb., 2013

Phase Coexistence and Slow Mixing for the Hard-Core Model on ℤ2.

[BibT_eX]

[DOI]

Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2013

2012

Reverse mathematics and infinite traceable graphs.

[BibT_eX]

[DOI]

Peter Cholak

Reed Solomon

Math. Log. Q., 2012

H-coloring tori.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2012

H-colouring bipartite graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2012

The independent set sequence of regular bipartite graphs.

[BibT_eX]

[DOI]

Discret. Math., 2012

Phase Coexistence and Slow Mixing for the Hard-Core Model on Z^2

[BibT_eX]

[DOI]

CoRR, 2012

Sampling 3-colourings of regular bipartite graphs

[BibT_eX]

[DOI]

CoRR, 2012

2011

The Multistate Hard Core Model on a Regular Tree.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2011

The Number of Independent Sets in a Graph with Small Maximum Degree.

[BibT_eX]

[DOI]

Yufei Zhao

Graphs Comb., 2011

Two problems on independent sets in graphs.

[BibT_eX]

[DOI]

Discret. Math., 2011

A Threshold Phenomenon for Random Independent Sets in the Discrete Hypercube.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2011

2009

Matchings and independent sets of a fixed size in regular graphs.

[BibT_eX]

[DOI]

Teena Carroll

J. Comb. Theory A, 2009

An upper bound for the number of independent sets in regular graphs.

[BibT_eX]

[DOI]

Discret. Math., 2009

2008

Sampling independent sets in the discrete torus.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2008

2007

Torpid mixing of local Markov chains on 3-colorings of the discrete torus.

[BibT_eX]

[DOI]

Dana Randall

Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

2006

Slow mixing of Glauber dynamics for the hard-core model on regular bipartite graphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2006

Bounding the Partition Function of Spin-Systems.

[BibT_eX]

[DOI]

Electron. J. Comb., 2006

Global connectivity from local geometric constraints for sensor networks with various wireless footprints.

[BibT_eX]

[DOI]

Proceedings of the Fifth International Conference on Information Processing in Sensor Networks, 2006

2004

On Phase Transition in the Hard-Core Model on Math.

[BibT_eX]

[DOI]

Jeff Kahn

Comb. Probab. Comput., 2004

Slow mixing of Glauber dynamics for the hard-core model on the hypercube.

[BibT_eX]

[DOI]

Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

2001

On Weighted Graph Homomorphisms.

[BibT_eX]

[DOI]