default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDavid J. Galvin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j34]John Engbers, David J. Galvin, Cliff Smyth:
Reciprocals of thinned exponential series. Australas. J Comb. 89: 61-96 (2024)- [j33]David J. Galvin, Gwen McKinley, Will Perkins
, Michail Sarantis, Prasad Tetali:
On the zeroes of hypergraph independence polynomials. Comb. Probab. Comput. 33(1): 65-84 (2024) - [j32]Abdul Basit, David J. Galvin:
Generalized Tuza's Conjecture for Random Hypergraphs. SIAM J. Discret. Math. 38(3): 2260-2288 (2024) - 2022
- [j31]Taylor Ball, David J. Galvin, Catherine Hyry, Kyle Weingartner:
Independent set and matching permutations. J. Graph Theory 99(1): 40-57 (2022) - [i8]David J. Galvin, Gwen McKinley, Will Perkins, Michail Sarantis, Prasad Tetali:
On the zeroes of hypergraph independence polynomials. CoRR abs/2211.00464 (2022) - 2021
- [j30]Abdul Basit, David J. Galvin:
On the Independent Set Sequence of a Tree. Electron. J. Comb. 28(3): 3 (2021) - 2020
- [j29]David J. Galvin, Adrian Pacurar:
Total non-negativity of some combinatorial matrices. J. Comb. Theory A 172: 105179 (2020) - [j28]Amirhossein Jalali, Robert W. Foley, Robert M. Maweni, Keefe Murphy, Dara J. Lundon, Thomas Lynch, Richard Power, Frank O'Brien, Kieran J. O'Malley, David J. Galvin, Garrett C. Durkan, Thomas Brendan Murphy, R. William G. Watson:
A risk calculator to inform the need for a prostate biopsy: a rapid access clinic cohort. BMC Medical Informatics Decis. Mak. 20(1): 148 (2020)
2010 – 2019
- 2019
- [j27]Teena Carroll, David J. Galvin:
The Game of Plates and Olives. Electron. J. Comb. 26(1): 1 (2019) - [j26]Antonio Blanca, Yuxuan Chen, David J. Galvin, Dana Randall, Prasad Tetali:
Phase Coexistence for the Hard-Core Model on ℤ2. Comb. Probab. Comput. 28(1): 1-22 (2019) - [j25]John Engbers, David J. Galvin, Cliff Smyth:
Restricted Stirling and Lah number matrices and their inverses. J. Comb. Theory A 161: 271-298 (2019) - 2017
- [j24]John Engbers, David J. Galvin:
Extremal H-colorings of trees and 2-connected graphs. J. Comb. Theory B 122: 800-814 (2017) - 2016
- [j23]James M. Carraher, David J. Galvin, Stephen G. Hartke, A. J. Radcliffe, Derrick Stolee:
On the independence ratio of distance graphs. Discret. Math. 339(12): 3058-3072 (2016) - [j22]David J. Galvin:
Asymptotic Normality of Some Graph Sequences. Graphs Comb. 32(2): 639-647 (2016) - [j21]Deeparnab Chakrabarty, David J. Galvin:
Special Issue: APPROX-RANDOM 2014: Guest Editors' Foreword. Theory Comput. 12(1): 1-3 (2016) - [i7]Antonio Blanca, Yuxuan Chen, David J. Galvin, Dana Randall, Prasad Tetali:
Phase Coexistence for the Hard-Core Model on ${\mathbb Z}^2$. CoRR abs/1611.01115 (2016) - [i6]Artem Chernikov, David J. Galvin, Sergei Starchenko:
Cutting lemma and Zarankiewicz's problem in distal structures. CoRR abs/1612.00908 (2016) - 2015
- [j20]John Engbers, David J. Galvin, Justin Hilyard:
Combinatorially interpreting generalized Stirling numbers. Eur. J. Comb. 43: 32-54 (2015) - [j19]David J. Galvin:
Counting Colorings of a Regular Graph. Graphs Comb. 31(3): 629-638 (2015) - [j18]David J. Galvin, Jeff Kahn, Dana Randall, Gregory B. Sorkin:
Phase coexistence and torpid mixing in the 3-coloring model on ℤd. SIAM J. Discret. Math. 29(3): 1223-1244 (2015) - 2014
- [j17]John Engbers, David J. Galvin:
Counting Independent Sets of a Fixed Size in Graphs with a Given Minimum Degree. J. Graph Theory 76(2): 149-168 (2014) - 2013
- [j16]David J. Galvin, Do Trong Thanh:
Stirling Numbers of Forests and Cycles. Electron. J. Comb. 20(1): 73 (2013) - [j15]David J. Galvin:
Maximizing H-Colorings of a Regular Graph. J. Graph Theory 73(1): 66-84 (2013) - [c5]Antonio Blanca, David J. Galvin, Dana Randall, Prasad Tetali:
Phase Coexistence and Slow Mixing for the Hard-Core Model on ℤ2. APPROX-RANDOM 2013: 379-394 - [i5]John Engbers, David J. Galvin, Justin Hilyard:
Combinatorially interpreting generalized Stirling numbers. CoRR abs/1308.2666 (2013) - 2012
- [j14]David J. Galvin:
The independent set sequence of regular bipartite graphs. Discret. Math. 312(19): 2881-2892 (2012) - [j13]John Engbers, David J. Galvin:
H-colouring bipartite graphs. J. Comb. Theory B 102(3): 726-742 (2012) - [j12]John Engbers, David J. Galvin:
H-coloring tori. J. Comb. Theory B 102(5): 1110-1133 (2012) - [j11]Peter Cholak, David J. Galvin, Reed Solomon:
Reverse mathematics and infinite traceable graphs. Math. Log. Q. 58(1-2): 18-28 (2012) - [i4]David J. Galvin, Prasad Tetali:
Slow mixing of Glauber Dynamics for the hard-core model on regular bipartite graphs. CoRR abs/1206.3165 (2012) - [i3]David J. Galvin, Dana Randall:
Torpid Mixing of Local Markov Chains on 3-Colorings of the Discrete Torus. CoRR abs/1206.3193 (2012) - [i2]David J. Galvin:
Sampling 3-colourings of regular bipartite graphs. CoRR abs/1206.3202 (2012) - [i1]Antonio Blanca, David J. Galvin, Dana Randall, Prasad Tetali:
Phase Coexistence and Slow Mixing for the Hard-Core Model on Z^2. CoRR abs/1211.6182 (2012) - 2011
- [j10]David J. Galvin:
A Threshold Phenomenon for Random Independent Sets in the Discrete Hypercube. Comb. Probab. Comput. 20(1): 27-51 (2011) - [j9]David J. Galvin:
Two problems on independent sets in graphs. Discret. Math. 311(20): 2105-2112 (2011) - [j8]David J. Galvin, Yufei Zhao:
The Number of Independent Sets in a Graph with Small Maximum Degree. Graphs Comb. 27(2): 177-186 (2011) - [j7]David J. Galvin, Fabio Martinelli, Kavita Ramanan, Prasad Tetali:
The Multistate Hard Core Model on a Regular Tree. SIAM J. Discret. Math. 25(2): 894-915 (2011)
2000 – 2009
- 2009
- [j6]David J. Galvin:
An upper bound for the number of independent sets in regular graphs. Discret. Math. 309(23-24): 6635-6640 (2009) - [j5]Teena Carroll, David J. Galvin, Prasad Tetali:
Matchings and independent sets of a fixed size in regular graphs. J. Comb. Theory A 116(7): 1219-1227 (2009) - 2008
- [j4]David J. Galvin:
Sampling independent sets in the discrete torus. Random Struct. Algorithms 33(3): 356-376 (2008) - 2007
- [c4]David J. Galvin, Dana Randall:
Torpid mixing of local Markov chains on 3-colorings of the discrete torus. SODA 2007: 376-384 - 2006
- [j3]David J. Galvin:
Bounding the Partition Function of Spin-Systems. Electron. J. Comb. 13(1) (2006) - [j2]David J. Galvin, Prasad Tetali:
Slow mixing of Glauber dynamics for the hard-core model on regular bipartite graphs. Random Struct. Algorithms 28(4): 427-443 (2006) - [c3]Raissa M. D'Souza, David J. Galvin, Cristopher Moore, Dana Randall:
Global connectivity from local geometric constraints for sensor networks with various wireless footprints. IPSN 2006: 19-26 - 2004
- [j1]David J. Galvin, Jeff Kahn:
On Phase Transition in the Hard-Core Model on Math. Comb. Probab. Comput. 13(2): 137-164 (2004) - [c2]David J. Galvin, Prasad Tetali:
Slow mixing of Glauber dynamics for the hard-core model on the hypercube. SODA 2004: 466-467 - 2001
- [c1]David J. Galvin, Prasad Tetali:
On Weighted Graph Homomorphisms. Graphs, Morphisms and Statistical Physics 2001: 97-104
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:14 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
