David Galvin

From MaRDI portal
Person:292263

Available identifiers

zbMath Open galvin.david-jMaRDI QIDQ292263

List of research outcomes





PublicationDate of PublicationType
On the zeroes of hypergraph independence polynomials2024-11-05Paper
Reciprocals of thinned exponential series2024-06-26Paper
Independent set and matching permutations2023-10-04Paper
Totally non-negativity of a family of change-of-basis matrices2023-09-05Paper
Reciprocals of thinned exponential series2023-03-24Paper
On the zeroes of hypergraph independence polynomials2022-11-01Paper
Enumerating threshold graphs and some related graph classes2022-05-31Paper
Cutting lemma and Zarankiewicz's problem in distal structures2020-03-24Paper
Phase Coexistence for the Hard-Core Model on ℤ22020-03-11Paper
Total non-negativity of some combinatorial matrices2020-02-21Paper
The game of plates and olives2019-03-05Paper
Restricted Stirling and Lah number matrices and their inverses2018-11-08Paper
The independent set sequence of some families of trees2018-04-10Paper
Extremal \(H\)-colorings of trees and 2-connected graphs2016-11-25Paper
On the independence ratio of distance graphs2016-08-16Paper
https://portal.mardi4nfdi.de/entity/Q55012932015-08-03Paper
Phase coexistence and torpid mixing in the 3-coloring model on ${\mathbb Z}^d$2015-07-31Paper
Counting colorings of a regular graph2015-05-22Paper
Torpid Mixing of Local Markov Chains on 3-Colorings of the Discrete Torus2014-12-18Paper
Combinatorially interpreting generalized Stirling numbers2014-10-08Paper
Counting Independent Sets of a Fixed Size in Graphs with a Given Minimum Degree2014-05-28Paper
Phase Coexistence and Slow Mixing for the Hard-Core Model on ℤ22013-10-04Paper
Stirling numbers of forests and cycles2013-06-07Paper
Maximizing H‐Colorings of a Regular Graph2013-05-21Paper
\(H\)-coloring tori2012-10-19Paper
\(H\)-colouring bipartite graphs2012-05-11Paper
Reverse mathematics and infinite traceable graphs2012-02-29Paper
The number of independent sets in a graph with small maximum degree2012-01-24Paper
The Multistate Hard Core Model on a Regular Tree2011-10-27Paper
Two problems on independent sets in graphs2011-10-21Paper
A Threshold Phenomenon for Random Independent Sets in the Discrete Hypercube2011-01-17Paper
An upper bound for the number of independent sets in regular graphs2009-12-15Paper
Matchings and independent sets of a fixed size in regular graphs2009-11-26Paper
Sampling independent sets in the discrete torus2009-03-04Paper
Sampling 3-colourings of regular bipartite graphs2007-11-23Paper
Slow mixing of Glauber dynamics for the hard‐core model on regular bipartite graphs2006-09-06Paper
Bounding the partition function of spin-systems2006-08-30Paper
On weighted graph homomorphisms2005-04-04Paper
On Phase Transition in the Hard-Core Model on ${\mathbb Z}^d$2004-09-24Paper
On homomorphisms from the Hamming cube to \(\mathbb{Z}\)2004-03-17Paper

Research outcomes over time

This page was built for person: David Galvin