Dominic Welsh: his work and influence

DOI10.1007/978-3-031-76738-8_18MaRDI QIDQ6860650zbMATH OpenFDO

Authors Graham Farr, Dillon Mayhew, James Oxley

Publication date 10 February 2026

Full work available at URL https://doi.org/10.1007/978-3-031-76738-8_18

Mathematics Subject Classification ID

Biographies, obituaries, personalia, bibliographies (01A70) History of combinatorics (05-03) Combinatorial aspects of matroids and geometric lattices (05B35) Graph polynomials (05C31) Ordinary differential equations (34-XX) Partial differential equations (35-XX) Dynamical systems and ergodic theory (37-XX) Global analysis, analysis on manifolds (58-XX) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25)

Cites work

• A bound for the number of matroids
• A characterisation of binary transversal structures
• A characterization of Tutte invariants of 2-polymatroids
• A Contribution to the Theory of Chromatic Polynomials
• A randomised 3-colouring algorithm
• A Randomised Approximation Algorithm for Counting the Number of Forests in Dense Graphs
• A unique factorization theorem for matroids
• A weighted graph polynomial from chromatic invariants of knots
• An entropy argument for counting matroids
• An upper bound for the chromatic number of a graph and its application to timetabling problems
• Approximate Counting and Quantum Computation
• Approximating the Number of Acyclic Orientations for a Class of Sparse Graphs
• Arrangements, channel assignments, and associated polynomials
• Chip firing and the Tutte polynomial
• Combinatorial applications of an inequality from statistical mechanics
• Combinatorics, Complexity, and Chance
• Complexity and Cryptography
• Complexity of graph polynomials
• Counting matroids in minor-closed classes
• Counting phylogenetic networks
• CRISPIN ST J. A. NASH-WILLIAMS (1932–2001)
• Determining the thickness of graphs is NP-hard
• Euler and bipartite matroids
• Evaluating the Tutte Polynomial for Graphs of Bounded Tree-Width
• Forests, colorings and acyclic orientations of the square lattice
• FURTHER RESULTS ON THE RATE OF CONVERGENCE TO THE CONNECTIVE CONSTANT OF THE HYPERCUBICAL LATTICE
• Generalized versions of Hall's theorem
• Hard Enumeration Problems in Geometry and Combinatorics
• Hodge theory for combinatorial geometries
• scientific article; zbMATH DE number 420868 (Why is no real title available?)
• scientific article; zbMATH DE number 437298 (Why is no real title available?)
• scientific article; zbMATH DE number 3148802 (Why is no real title available?)
• scientific article; zbMATH DE number 3148803 (Why is no real title available?)
• scientific article; zbMATH DE number 5130821 (Why is no real title available?)
• scientific article; zbMATH DE number 3928066 (Why is no real title available?)
• scientific article; zbMATH DE number 3954959 (Why is no real title available?)
• scientific article; zbMATH DE number 3980105 (Why is no real title available?)
• scientific article; zbMATH DE number 3784908 (Why is no real title available?)
• scientific article; zbMATH DE number 15994 (Why is no real title available?)
• scientific article; zbMATH DE number 41062 (Why is no real title available?)
• scientific article; zbMATH DE number 3534506 (Why is no real title available?)
• scientific article; zbMATH DE number 3563154 (Why is no real title available?)
• scientific article; zbMATH DE number 3617539 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1246229 (Why is no real title available?)
• scientific article; zbMATH DE number 475578 (Why is no real title available?)
• scientific article; zbMATH DE number 1047748 (Why is no real title available?)
• scientific article; zbMATH DE number 1057883 (Why is no real title available?)
• scientific article; zbMATH DE number 1146225 (Why is no real title available?)
• scientific article; zbMATH DE number 195103 (Why is no real title available?)
• scientific article; zbMATH DE number 1369835 (Why is no real title available?)
• scientific article; zbMATH DE number 952958 (Why is no real title available?)
• scientific article; zbMATH DE number 3445271 (Why is no real title available?)
• scientific article; zbMATH DE number 878902 (Why is no real title available?)
• scientific article; zbMATH DE number 3216727 (Why is no real title available?)
• scientific article; zbMATH DE number 5873618 (Why is no real title available?)
• scientific article; zbMATH DE number 3231627 (Why is no real title available?)
• scientific article; zbMATH DE number 3301261 (Why is no real title available?)
• scientific article; zbMATH DE number 3326386 (Why is no real title available?)
• scientific article; zbMATH DE number 3333787 (Why is no real title available?)
• scientific article; zbMATH DE number 3336750 (Why is no real title available?)
• scientific article; zbMATH DE number 3368629 (Why is no real title available?)
• scientific article; zbMATH DE number 3370348 (Why is no real title available?)
• scientific article; zbMATH DE number 3049182 (Why is no real title available?)
• scientific article; zbMATH DE number 3088537 (Why is no real title available?)
• Matroid Complexity and Nonsuccinct Descriptions
• On properties of almost all matroids
• On some percolation results of J. M. Hammersley
• On the abstract properties of linear dependence.
• On the asymptotic proportion of connected matroids
• On the computational complexity of the Jones and Tutte polynomials
• On the Number of Combinatorial Geometries
• On the number of matroids
• On the number of non-isomorphic matroids
• On the number of sparse paving matroids
• Percolation in the random cluster process and Q-state Potts model
• Percolation Probabilities on the Square Lattice
• Percolation Processes: Lower Bounds for the Critical Probability
• Polynomial time randomized approximation schemes for Tutte–Gröthendieck invariants: The dense case
• Probability. An introduction
• Proof of a chromatic polynomial conjecture
• Random planar graphs
• Randomised algorithms
• Removing Edges Can Increase the Average Number of Colours in the Colourings of a Graph
• SOME RESULTS ON TRANSVERSAL MATROIDS AND CONSTRUCTIONS FOR IDENTICALLY SELF-DUAL MATROIDS
• The Asymptotic Number of Binary Codes and Binary Matroids
• The coloring of graphs.
• The complexities of the coefficients of the Tutte polynomial
• The complexity of colouring problems on dense graphs
• The complexity of some graph colouring problems
• The computational complexity of matroid properties
• The Computational Complexity of the Tutte Plane: the Bipartite Case
• The contributions of Dominic Welsh to matroid theory
• The critical probability of bond percolation on the square lattice equals 1/2
• The Markov chain of colourings
• The Merino-Welsh conjecture is false for matroids
• The number of partial Steiner systems and d-partitions
• The Potts model and the Tutte polynomial.
• The Tutte polynomial. I: General theory
• Topological quantum computation
• Transversal Theory and Matroids
• Tutte-Whitney polynomials: some history and generalizations

This page was built for publication: Dominic Welsh: his work and influence

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6860650)