The following pages link to Péter Csikvári (Q412252):
Displaying 19 items.
- Two remarks on the adjoint polynomial (Q412253) (← links)
- Graph homomorphisms between trees (Q463048) (← links)
- Matchings in vertex-transitive bipartite graphs (Q502979) (← links)
- Sidorenko's conjecture, colorings and independent sets (Q510305) (← links)
- Chromatic roots and limits of dense graphs (Q512616) (← links)
- The Widom-Rowlinson model, the hard-core model and the extremality of the complete graph (Q518178) (← links)
- Graphs with integer matching polynomial zeros (Q526810) (← links)
- On a poset of trees (Q532127) (← links)
- Integral trees of arbitrarily large diameters (Q604822) (← links)
- Applications of the Kelmans transformation: extremality of the threshold graphs (Q640440) (← links)
- On the roots of edge cover polynomials of graphs (Q648996) (← links)
- Covers, orientations and factors (Q785575) (← links)
- Matching measure, Benjamini-Schramm convergence and the monomer-dimer free energy (Q888932) (← links)
- Benjamini-Schramm continuity of root moments of graph polynomials (Q896079) (← links)
- On a conjecture of V. Nikiforov (Q1043985) (← links)
- Matchings in regular graphs: minimizing the partition function (Q4997230) (← links)
- On Sidorenko's conjecture for determinants and Gaussian Markov random fields (Q6074867) (← links)
- On complex roots of the independence polynomial (Q6396168) (← links)
- The Merino-Welsh conjecture is false for matroids (Q6496873) (← links)
