Research
Extremal combinatorics, Probabilistic combinatorics, Graph polynomials / partition functions, Phase transitions, Approximation algorithms (for counting)
Interests
TBC
Publications of specific relevance to the Centre for Combinatorics, Algebra and Number Theory
Publications of specific relevance to the Centre for Combinatorics, Algebra and Number Theory
2025
Cycle Partitions in Dense Regular Digraphs and Oriented GraphsLo A Patel V Yıldız MA
Forum of Mathematics Sigma,
Cambridge University Press (Cup) vol. 13
01-01-20252024
Improved bounds for the zeros of the chromatic polynomial via Whitney's Broken Circuit TheoremJenssen M Patel V Regts G
Journal of Combinatorial Theory Series B,
Elsevier vol. 169, 233-252.
01-11-2024 Hamilton cycles in dense regular digraphs and oriented graphsLo A Patel V Yıldız MA
Journal of Combinatorial Theory Series B,
Elsevier vol. 164, 119-160.
01-01-2024 2023
Orthogonal schedules in single round robin tournamentsLambers R Briët J Patel V Spieksma F Yıldız MA
Operations Research Letters,
Elsevier vol. 51 (5), 528-532.
01-09-2023 Cycle Partition of Dense Regular Digraphs and Oriented GraphsLo A Patel V Yildiz MA
Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications. (12), 717-724.
28-08-2023 2022
Approximate counting using Taylor's theorem: a surveyPatel V Regts G
15-12-2022 A POLYNOMIAL-TIME ALGORITHM TO DETERMINE (ALMOST) HAMILTONICITY OF DENSE REGULAR GRAPHSPatel V Stroh F
Siam Journal on Discrete Mathematics,
Society For Industrial and Applied Mathematics vol. 36 (2), 1363-1393.
07-06-2022 Sampling from the low temperature Potts model through a Markov chain on flowsHuijben J Patel V Regts G
Random Structures and Algorithms,
Wiley 16-04-2022 Lee–Yang zeros and the complexity of the ferromagnetic Ising model on bounded-degree graphsBuys P Galanis A Patel V Regts G
Forum of Mathematics Sigma,
Cambridge University Press (Cup) vol. 10
01-01-2022 2021
On zero-free regions for the anti-ferromagnetic potts model on bounded-degree graphsBencs F Davies E Patel V Regts G
Annales De L’Institut Henri Poincaré D,
Ems Press vol. 8 (3), 459-489.
23-09-2021 Structure and colour in triangle-free graphsAravind NR van Batenburg WC Kang RJ Cambie S de Verclos RDJ Patel V
Journal of Combinatorics,
Electronic Journal of Combinatorics vol. 28 (2)
18-06-2021 Lee-Yang zeros and the complexity of the ferromagnetic Ising Model on bounded-degree graphsBuys P Galanis A Patel V Regts G
Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms., 1508-1519.
01-01-2021 Path Decompositions of Random Directed GraphsEspuny Díaz A Patel V Stroh F
In
Extended Abstracts Eurocomb 2021,
Springer Nature 702-706.
01-01-2021 2020
Switch-Based Markov Chains for Sampling Hamiltonian Cycles in Dense GraphsKleer P Patel V Stroh F
The Electronic Journal of Combinatorics,
The Electronic Journal of Combinatorics vol. 27 (4)
13-11-2020 Statistical physics approaches to Unique GamesCoulson M Davies E Kolla A Patel V Regts G
Leibniz International Proceedings in Informatics Lipics. vol. 169
01-07-2020 Decomposing tournaments into pathsLo A Patel V Skokan J Talbot J
Proceedings of The London Mathematical Society,
Wiley vol. 121 (2), 426-461.
29-04-2020 2019
Discrepancy and large dense monochromatic subsetsKang RJ Patel V Regts G
Journal of Combinatorics,
International Press of Boston vol. 10 (1), 87-109.
01-01-2019 2018
Hamilton Cycles in Sparse Robustly Expanding DigraphsLo A Patel V
The Electronic Journal of Combinatorics,
The Electronic Journal of Combinatorics vol. 25 (3)
07-09-2018 Computing the Number of Induced Copies of a Fixed Graph in a Bounded Degree GraphPatel V Regts G
Algorithmica,
Springer Nature vol. 81 (5), 1844-1858.
05-09-2018 Excluding Hooks and their ComplementsChoromanski K Falik D Liebenau A Patel V Pilipczuk M
The Electronic Journal of Combinatorics,
The Electronic Journal of Combinatorics vol. 25 (3)
24-08-2018 2017
On a Ramsey‐type problem of Erdős and PachKang RJ Long E Patel V Regts G
Bulletin of The London Mathematical Society,
Wiley vol. 49 (6), 991-999.
06-10-2017 Decomposing tournaments into pathsLo A Patel V Skokan J Talbot J
Electronic Notes in Discrete Mathematics,
Elsevier vol. 61, 813-818.
01-08-2017 Deterministic polynomial-time approximation algorithms for partition functions and graph polynomialsPatel V Regts G
Electronic Notes in Discrete Mathematics,
Elsevier vol. 61, 971-977.
01-08-2017 Deterministic Polynomial-Time Approximation Algorithms for Partition Functions and Graph PolynomialsPatel V Regts G
Siam Journal on Computing,
Society For Industrial & Applied Mathematics (Siam) vol. 46 (6), 1893-1919.
01-01-2017 2016
Parameterized Traveling Salesman Problem: Beating the AverageGutin G Patel V
Siam Journal on Discrete Mathematics,
Society For Industrial & Applied Mathematics (Siam) vol. 30 (1), 220-238.
01-01-2016 2015
On a Ramsey-type problem of Erdős and PachKang RJ Patel V Regts G
Electronic Notes in Discrete Mathematics,
Elsevier vol. 49, 821-827.
01-11-2015 A domination algorithm for {0,1}‐instances of the travelling salesman problemKühn D Osthus D Patel V
Random Structures and Algorithms,
Wiley vol. 48 (3), 427-453.
08-10-2015 Finding Shortest Paths Between Graph ColouringsJohnson M Kratsch D Kratsch S Patel V Paulusma D
Algorithmica,
Springer Nature vol. 75 (2), 295-321.
12-05-2015 Poset limits can be totally orderedHladký J Máthé A Patel V Pikhurko O
Transactions of The American Mathematical Society,
American Mathematical Society (Ams) vol. 367 (6), 4319-4337.
03-02-2015 A Precise Threshold for Quasi-Ramsey NumbersKang RJ Pach J Patel V Regts G
Siam Journal on Discrete Mathematics,
Society For Industrial & Applied Mathematics (Siam) vol. 29 (3), 1670-1682.
01-01-2015 2014
Mixing of the Glauber dynamics for the ferromagnetic Potts modelBordewich M Greenhill C Patel V
Random Structures and Algorithms,
Wiley vol. 48 (1), 21-52.
04-09-2014 Tight inequalities among set hitting times in Markov chainsGriffiths S Kang RJ Oliveira RI Patel V
Proceedings of The American Mathematical Society,
American Mathematical Society (Ams) vol. 142 (9), 3285-3298.
21-05-2014 Proof of a conjecture of Thomassen on Hamilton cycles in highly connected tournamentsKuehn D Lapinskas J Osthus D Patel V
Proceedings of The London Mathematical Society vol. 109, 733-762.
01-01-2014 Finding Shortest Paths Between Graph ColouringsJohnson M Kratsch D Kratsch S Patel V Paulusma D
Lecture Notes in Computer Science. vol. 8894, 221-233.
01-01-2014 2013
Obtaining Online Ecological Colourings by Generalizing First-FitJohnson M Patel V Paulusma D Trunck T
Theory of Computing Systems,
Springer Nature vol. 54 (2), 244-260.
07-12-2013 Tight complexity bounds for FPT subgraph problems parameterized by the clique-widthBroersma H Golovach PA Patel V
Theoretical Computer Science,
Elsevier vol. 485, 69-84.
01-05-2013 On Toughness and Hamiltonicity of 2K2‐Free GraphsBroersma H Patel V Pyatkin A
Journal of Graph Theory,
Wiley vol. 75 (3), 244-255.
19-02-2013 Determining Edge Expansion and Other Connectivity Measures of Graphs of Bounded GenusPatel V
Siam Journal on Computing,
Society For Industrial & Applied Mathematics (Siam) vol. 42 (3), 1113-1131.
01-01-2013 Proof of a conjecture of Thomassen on Hamilton cycles in highly connected tournamentsKühn D Lapinskas J Osthus D Patel V
In
The Seventh European Conference on Combinatorics, Graph Theory and Applications,
Springer Nature 471-476.
01-01-2013 2012
The complexity of finding uniform sparsest cuts in various graph classesBonsma P Broersma H Patel V Pyatkin A
Journal of Discrete Algorithms. vol. 14, 136-149.
01-07-2012 Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphsBonamy M Johnson M Lignos I Patel V Paulusma D
Journal of Combinatorial Optimization. vol. 27 (1), 132-143.
26-04-2012 Tight Complexity Bounds for FPT Subgraph Problems Parameterized by Clique-WidthBroersma H Golovach PA Patel V
Lecture Notes in Computer Science. vol. 7112, 207-218.
01-01-2012 2011
On the diameter of reconfiguration graphs for vertex colouringsBonamy M Johnson M Lignos I Patel V Paulusma D
Electronic Notes in Discrete Mathematics,
Elsevier vol. 38, 161-166.
01-12-2011 The Complexity Status of Problems Related to Sparsest CutsBonsma P Broersma H Patel V Pyatkin A
Lecture Notes in Computer Science. vol. 6460, 125-135.
01-01-2011 2010
Average relational distance in linear extensions of posetsBrightwell G Patel V
Discrete Mathematics,
Elsevier vol. 310 (5), 1016-1021.
01-03-2010 Determining Edge Expansion and Other Connectivity Measures of Graphs of Bounded GenusPatel V
Lecture Notes in Computer Science. vol. 6346, 561-572.
01-01-2010 Obtaining Online Ecological Colourings by Generalizing First-FitJohnson M Patel V Paulusma D Trunck T
Lecture Notes in Computer Science. vol. 6072, 240-251.
01-01-2010 2008
Partitioning PosetsPatel V
Order,
Springer Nature vol. 25 (2), 131-152.
01-05-2008 2007
Cutting two graphs simultaneouslyPatel V
Journal of Graph Theory,
Wiley vol. 57 (1), 19-32.
22-10-2007
