David Galvin

发表

A Threshold Phenomenon for Random Independent Sets in the Discrete Hypercube

David Galvin, 2011, Comb. Probab. Comput..

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

Yufei Zhao, David Galvin, 2011, Graphs Comb..

On Weighted Graph Homomorphisms

Prasad Tetali, David Galvin, 2001, Graphs, Morphisms and Statistical Physics.

The independent set sequence of regular bipartite graphs

David Galvin, 2012, Discret. Math..

Maximizing H‐Colorings of a Regular Graph

David Galvin, David J. Galvin, 2011, J. Graph Theory.

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

Dana Randall, Prasad Tetali, David Galvin, 2012, APPROX-RANDOM.

On Phase Transition in the Hard-Core Model on ${\mathbb Z}^d$

Jeff Kahn, David Galvin, David J. Galvin, 2004, Combinatorics, Probability and Computing.

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

Prasad Tetali, David Galvin, David J. Galvin, 2004, SODA '04.

Extremal H-colorings of trees and 2-connected graphs

David Galvin, John Engbers, David J. Galvin, 2015, J. Comb. Theory, Ser. B.

Counting Colorings of a Regular Graph

David Galvin, 2015, Graphs Comb..

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

Prasad Tetali, David Galvin, David J. Galvin, 2006, Random Struct. Algorithms.

Restricted Stirling and Lah number matrices and their inverses

David Galvin, Clifford Smyth, John Engbers, 2019, J. Comb. Theory, Ser. A.

Total non-negativity of some combinatorial matrices

David Galvin, Adrian Pacurar, 2020, J. Comb. Theory, Ser. A.

Phase coexistence and torpid mixing in the 3-coloring model on ℤd

Dana Randall, Jeff Kahn, David Galvin, 2012, SIAM J. Discret. Math..

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

David Galvin, John Engbers, 2014, J. Graph Theory.

H-colouring bipartite graphs

David Galvin, John Engbers, 2012, J. Comb. Theory, Ser. B.

Cutting lemma and Zarankiewicz’s problem in distal structures

David Galvin, Sergei Starchenko, Artem Chernikov, 2016, Selecta Mathematica.

On the independence ratio of distance graphs

James M. Carraher, Stephen G. Hartke, Derrick Stolee, 2014, Discret. Math..

Phase Coexistence for the Hard-Core Model on ℤ2

Dana Randall, Prasad Tetali, David Galvin, 2018, Combinatorics, Probability and Computing.

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

David Galvin, Deeparnab Chakrabarty, 2016, Theory Comput..

The Multistate Hard Core Model on a Regular Tree

Fabio Martinelli, Prasad Tetali, David Galvin, 2011, SIAM J. Discret. Math..

Matchings and independent sets of a fixed size in regular graphs

Prasad Tetali, David Galvin, Teena Carroll, 2009, J. Comb. Theory, Ser. A.

Two problems on independent sets in graphs

David Galvin, 2011, Discret. Math..

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

David Galvin, 2009, Discret. Math..

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

Dana Randall, David Galvin, David J. Galvin, 2007, SODA '07.

Combinatorially interpreting generalized Stirling numbers pdf

David Galvin, John Engbers, Justin Hilyard, 2013, Eur. J. Comb..

Sampling 3-colourings of regular bipartite graphs pdf

David Galvin, David J. Galvin, 2007, ArXiv.

H-coloring tori

David Galvin, John Engbers, David J. Galvin, 2011, J. Comb. Theory, Ser. B.

Asymptotic Normality of Some Graph Sequences

David Galvin, David J. Galvin, 2013, Graphs Comb..

PR ] 3 N ov 2 01 6 Phase Coexistence for the Hard-Core Model on Z 2 pdf

Dana Randall, Prasad Tetali, David Galvin, 2016 .

The Game of Plates and Olives

David Galvin, Teena Carroll, 2019, Electron. J. Comb..

Stirling Numbers of Forests and Cycles

David Galvin, Do Trong Thanh, David J. Galvin, 2012, Electron. J. Comb..

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

Dana Randall, Cristopher Moore, David Galvin, 2006, 2006 5th International Conference on Information Processing in Sensor Networks.

Sampling independent sets in the discrete torus

David Galvin, David J. Galvin, 2008, Random Struct. Algorithms.

Reverse mathematics and infinite traceable graphs

David Galvin, Peter Cholak, Reed Solomon, 2012, Math. Log. Q..

On the Independent Set Sequence of a Tree

David Galvin, Abdul Basit, 2021, Electron. J. Comb..

Enumerating threshold graphs and some related graph classes

David Galvin, David J. Galvin, Greyson Wesley, 2021, 2110.08953.

Restricted Stirling and Lah numbers, and their inverses

David Galvin, 2016 .

Brégman ’ s theorem and extensions

David Galvin, David J. Galvin, 2011 .

Sampling independent sets in the discrete torus

David Galvin, 2008 .

On phase transition in the hard-core model on ${\bf Z}^d$

David Galvin, Jeff Kahn, David J. Galvin, 2012, 1206.3144.

A topological approach to evasiveness

David Galvin, David J. Galvin, 2010 .

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

Prasad Tetali, David Galvin, David J. Galvin, 2006 .