Catherine S. Greenhill

Bernard Mans

Ali Pourmiri

J. Comput. Syst. Sci., December, 2023

Degree sequences of sufficiently dense random uniform hypergraphs.

[BibT_eX]

[DOI]

Tamás Makai

Comb. Probab. Comput., March, 2023

A triangle process on graphs with given degree sequence.

[BibT_eX]

[DOI]

CoRR, 2023

2022

The mixing time of switch Markov chains: A unified approach.

[BibT_eX]

[DOI]

Péter L. Erdös

Eur. J. Comb., 2022

Spanning trees in random regular uniform hypergraphs.

[BibT_eX]

[DOI]

Gary Liang

Comb. Probab. Comput., 2022

Lower Bounds on the Chromatic Number of Random Graphs.

[BibT_eX]

[DOI]

Peter J. Ayre

Amin Coja-Oghlan

Comb., 2022

2021

Counting independent sets in graphs with bounded bipartite pathwidth.

[BibT_eX]

[DOI]

Haiko Müller

Random Struct. Algorithms, 2021

Sampling hypergraphs with given degrees.

[BibT_eX]

[DOI]

Pieter Kleer

James Ross

Leen Stougie

Discret. Math., 2021

The average number of spanning hypertrees in sparse uniform hypergraphs.

[BibT_eX]

[DOI]

Haya S. Aldosari

Discret. Math., 2021

Mixing time of the switch Markov chain and stable degree sequences.

[BibT_eX]

[DOI]

Pu Gao

Discret. Appl. Math., 2021

Subgraph counts for dense random graphs with specified degrees.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2021

A Triangle Process on Regular Graphs.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 32nd International Workshop, 2021

Generating graphs randomly.

[BibT_eX]

[DOI]

Proceedings of the Surveys in Combinatorics, 2021

2020

A threshold result for loose Hamiltonicity in random regular uniform hypergraphs.

[BibT_eX]

[DOI]

Daniel Altman

Reshma Ramadurai

J. Comb. Theory B, 2020

On the Parameterised Complexity of Induced Multipartite Graph Parameters.

[BibT_eX]

[DOI]

Ryan L. Mann

Luke Mathieson

CoRR, 2020

Balanced Allocation on Dynamic Hypergraphs.

[BibT_eX]

[DOI]

Bernard Mans

Ali Pourmiri

Proceedings of the Approximation, 2020

2019

Rigid Colorings of Hypergraphs and Contiguity.

[BibT_eX]

[DOI]

Peter J. Ayre

SIAM J. Discret. Math., 2019

Hypergraph coloring up to condensation.

[BibT_eX]

[DOI]

Peter J. Ayre

Amin Coja-Oghlan

Random Struct. Algorithms, 2019

Enumerating sparse uniform hypergraphs with given degree sequence and forbidden edges.

[BibT_eX]

[DOI]

Haya S. Aldosari

Eur. J. Comb., 2019

The flip Markov chain for connected regular graphs.

[BibT_eX]

[DOI]

Andrew J. Handley

Discret. Appl. Math., 2019

Triangle-creation processes on cubic graphs.

[BibT_eX]

[DOI]

CoRR, 2019

The mixing time of the swap (switch) Markov chains: a unified approach.

[BibT_eX]

[DOI]

Péter L. Erdös

CoRR, 2019

Uniform Generation of Spanning Regular Subgraphs of a Dense Graph.

[BibT_eX]

[DOI]

Pu Gao

Electron. J. Comb., 2019

2018

The switch Markov chain for sampling irregular graphs and digraphs.

[BibT_eX]

[DOI]

Matteo Sfragara

Theor. Comput. Sci., 2018

2017

The average number of spanning trees in sparse graphs with given degrees.

[BibT_eX]

[DOI]

Matthew Kwan

Eur. J. Comb., 2017

2016

Mixing of the Glauber dynamics for the ferromagnetic Potts model.

[BibT_eX]

[DOI]

Magnus Bordewich

Viresh Patel

Random Struct. Algorithms, 2016

Asymptotic enumeration of sparse uniform hypergraphs with given degrees.

[BibT_eX]

[DOI]

Vladimir M. Blinovsky

Eur. J. Comb., 2016

Asymptotic Enumeration of Sparse Uniform Linear Hypergraphs with Given Degrees.

[BibT_eX]

[DOI]

Vladimir M. Blinovsky

Electron. J. Comb., 2016

2015

On the chromatic number of a random hypergraph.

[BibT_eX]

[DOI]

Alan M. Frieze

J. Comb. Theory B, 2015

The switch Markov chain for sampling irregular graphs (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

2014

The switch Markov chain for sampling irregular graphs.

[BibT_eX]

[DOI]

CoRR, 2014

On the Number of Spanning Trees in Random Regular Graphs.

[BibT_eX]

[DOI]

Matthew Kwan

David Wind

Electron. J. Comb., 2014

2013

Asymptotic Enumeration of Sparse Multigraphs with Given Degrees.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2013

Heat-bath Markov chains have no negative eigenvalues

[BibT_eX]

[DOI]

Mario Ullrich

CoRR, 2013

2012

Making Markov chains less lazy

[BibT_eX]

[DOI]

CoRR, 2012

2011

A Polynomial Bound on the Mixing Time of a Markov Chain for Sampling Regular Directed Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2011

2010

On the Number of Perfect Matchings in Random Lifts.

[BibT_eX]

[DOI]

Svante Janson

Comb. Probab. Comput., 2010

Asymptotic enumeration of correlation-immune boolean functions.

[BibT_eX]

[DOI]

E. Rodney Canfield

Zhicheng Gao

Robert W. Robinson

Cryptogr. Commun., 2010

2009

Random dense bipartite graphs and directed graphs with specified degrees.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2009

2008

The cycle structure of two rows in a random Latin square.

[BibT_eX]

[DOI]

Nicholas J. Cavenagh

Ian M. Wanless

Random Struct. Algorithms, 2008

Asymptotic enumeration of dense 0-1 matrices with specified line sums.

[BibT_eX]

[DOI]

E. Rodney Canfield

J. Comb. Theory A, 2008

Expansion properties of a random regular graph after random vertex deletions.

[BibT_eX]

[DOI]

Fred B. Holt

Eur. J. Comb., 2008

Asymptotic enumeration of sparse nonnegative integer matrices with specified row and column sums.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2008

2007

Sampling Regular Graphs and a Peer-to-Peer Network.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2007

2006

The generalized acyclic edge chromatic number of random regular graphs.

[BibT_eX]

[DOI]

Stefanie Gerke

J. Graph Theory, 2006

Asymptotic enumeration of sparse 0-1 matrices with irregular row and column sums.

[BibT_eX]

[DOI]

Xiaoji Wang

J. Comb. Theory A, 2006

Neighbour-Distinguishing Edge Colourings of Random Regular Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2006

2005

Bounds on the Generalised Acyclic Chromatic Numbers of Bounded Degree Graphs.

[BibT_eX]

[DOI]

Oleg Pikhurko

Graphs Comb., 2005

Generation of simple quadrangulations of the sphere.

[BibT_eX]

[DOI]

Gunnar Brinkmann

Sam Greenberg

Robin Thomas

Paul Wollan

Discret. Math., 2005

2004

Corrigendum: The complexity of counting graph homomorphisms.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2004

Hamiltonian decompositions of random bipartite regular graphs.

[BibT_eX]

[DOI]

Jeong Han Kim

J. Comb. Theory B, 2004

Random Hypergraph Processes with Degree Restrictions.

[BibT_eX]

[DOI]

Graphs Comb., 2004

The Relative Complexity of Approximate Counting Problems.

[BibT_eX]

[DOI]

Algorithmica, 2004

2003

Connectedness Of The Degree Bounded Star Process.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2003

2002

Very rapid mixing of the Glauber dynamics for proper colorings on bounded-degree graphs.

[BibT_eX]

[DOI]

Michael Molloy

Random Struct. Algorithms, 2002

Permutation Pseudographs And Contiguity.

[BibT_eX]

[DOI]

Svante Janson

Jeong Han Kim

Comb. Probab. Comput., 2002

Convergence Of The Iterated Prisoner's Dilemma Game.

[BibT_eX]

[DOI]

Gabriel Istrate

Comb. Probab. Comput., 2002

2000

Polynomial-time counting and sampling of two-rowed contingency tables.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2000

An Extension of Path Coupling and Its Application to the Glauber Dynamics for Graph Colorings.

[BibT_eX]

[DOI]

Michael Mitzenmacher

SIAM J. Comput., 2000

The complexity of counting graph homomorphisms.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2000

An Algorithm for Recognising the Exterior Square of a Multiset.

[BibT_eX]

[DOI]

LMS J. Comput. Math., 2000

On Markov Chains for Independent Sets.

[BibT_eX]

[DOI]

J. Algorithms, 2000

The complexity of counting colourings and independent sets in sparse graphs and hypergraphs.

[BibT_eX]

[DOI]

Comput. Complex., 2000

An extension of path coupling and its application to the Glauber dynamics for graph colourings (extended abstract).

[BibT_eX]

[DOI]

Michael Mitzenmacher

Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

The complexity of counting graph homomorphisms (extended abstract).

[BibT_eX]

[DOI]

Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

1999

On Approximately Counting Colorings of Small Degree Graphs.

[BibT_eX]

[DOI]

Russ Bubley

SIAM J. Comput., 1999

1998

A more rapidly mixing Markov chain for graph colorings.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1998

Beating the 2 Delta Bound for Approximately Counting Colourings: A Computer-Assisted Proof of Rapid Mixing.

[BibT_eX]

[DOI]

Russ Bubley

Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998

A Genuinely Polynomial-Time Algorithms for Sampling Two-Rowed Contingency Tables.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 25th International Colloquium, 1998

1995

Theoretical and Experimental Comparison of Efficiency of Finite Field Extensions.

[BibT_eX]

[DOI]