David J. Galvin

Orcid: 0000-0002-9777-9852

According to our database1, David J. Galvin authored at least 43 papers between 2001 and 2024.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Reciprocals of thinned exponential series.
Australas. J Comb., June, 2024

On the zeroes of hypergraph independence polynomials.
Comb. Probab. Comput., January, 2024

Generalized Tuza's Conjecture for Random Hypergraphs.
SIAM J. Discret. Math., 2024

2022
Independent set and matching permutations.
J. Graph Theory, 2022

2021
On the Independent Set Sequence of a Tree.
Electron. J. Comb., 2021

2020
A risk calculator to inform the need for a prostate biopsy: a rapid access clinic cohort.
BMC Medical Informatics Decis. Mak., 2020

Total non-negativity of some combinatorial matrices.
J. Comb. Theory A, 2020

2019
Restricted Stirling and Lah number matrices and their inverses.
J. Comb. Theory A, 2019

Phase Coexistence for the Hard-Core Model on ℤ2.
Comb. Probab. Comput., 2019

The Game of Plates and Olives.
Electron. J. Comb., 2019

2017
Extremal H-colorings of trees and 2-connected graphs.
J. Comb. Theory B, 2017

2016
Special Issue: APPROX-RANDOM 2014: Guest Editors' Foreword.
Theory Comput., 2016

Asymptotic Normality of Some Graph Sequences.
Graphs Comb., 2016

On the independence ratio of distance graphs.
Discret. Math., 2016

Cutting lemma and Zarankiewicz's problem in distal structures.
CoRR, 2016

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

2015
Phase coexistence and torpid mixing in the 3-coloring model on ℤ<sup>d</sup>.
SIAM J. Discret. Math., 2015

Counting Colorings of a Regular Graph.
Graphs Comb., 2015

Combinatorially interpreting generalized Stirling numbers.
Eur. J. Comb., 2015

2014
Counting Independent Sets of a Fixed Size in Graphs with a Given Minimum Degree.
J. Graph Theory, 2014

2013
Maximizing <i>H</i>-Colorings of a Regular Graph.
J. Graph Theory, 2013

Stirling Numbers of Forests and Cycles.
Electron. J. Comb., 2013

Phase Coexistence and Slow Mixing for the Hard-Core Model on ℤ2.
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2013

2012
Reverse mathematics and infinite traceable graphs.
Math. Log. Q., 2012

H-coloring tori.
J. Comb. Theory B, 2012

H-colouring bipartite graphs.
J. Comb. Theory B, 2012

The independent set sequence of regular bipartite graphs.
Discret. Math., 2012

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

Sampling 3-colourings of regular bipartite graphs
CoRR, 2012

2011
The Multistate Hard Core Model on a Regular Tree.
SIAM J. Discret. Math., 2011

The Number of Independent Sets in a Graph with Small Maximum Degree.
Graphs Comb., 2011

Two problems on independent sets in graphs.
Discret. Math., 2011

A Threshold Phenomenon for Random Independent Sets in the Discrete Hypercube.
Comb. Probab. Comput., 2011

2009
Matchings and independent sets of a fixed size in regular graphs.
J. Comb. Theory A, 2009

An upper bound for the number of independent sets in regular graphs.
Discret. Math., 2009

2008
Sampling independent sets in the discrete torus.
Random Struct. Algorithms, 2008

2007
Torpid mixing of local Markov chains on 3-colorings of the discrete torus.
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.
Random Struct. Algorithms, 2006

Bounding the Partition Function of Spin-Systems.
Electron. J. Comb., 2006

Global connectivity from local geometric constraints for sensor networks with various wireless footprints.
Proceedings of the Fifth International Conference on Information Processing in Sensor Networks, 2006

2004
On Phase Transition in the Hard-Core Model on Math.
Comb. Probab. Comput., 2004

Slow mixing of Glauber dynamics for the hard-core model on the hypercube.
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

2001
On Weighted Graph Homomorphisms.
Proceedings of the Graphs, 2001


  Loading...