The following pages link to Péter Csikvári (Q412252):
Displaying 38 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)
- On the number of forests and connected spanning subgraphs (Q2053728) (← links)
- Note on the sum of the smallest and largest eigenvalues of a triangle-free graph (Q2154291) (← links)
- Evaluations of Tutte polynomials of regular graphs (Q2171029) (← links)
- Counting degree-constrained subgraphs and orientations (Q2174586) (← links)
- Some applications of Wagner's weighted subgraph counting polynomial (Q2236817) (← links)
- Density and Ramsey type results on algebraic equations with restricted solution sets (Q2448936) (← links)
- Lower matching conjecture, and a new proof of Schrijver's and Gurvits's theorems (Q2628330) (← links)
- Random cluster model on regular graphs (Q2696100) (← links)
- Upper bound for the number of spanning forests of regular graphs (Q2700981) (← links)
- Short proof of a theorem of Brylawski on the coefficients of the Tutte polynomial (Q2700984) (← links)
- Matchings in Benjamini–Schramm convergent graph sequences (Q2790620) (← links)
- On a Poset of Trees II (Q2852613) (← links)
- The Density Turán Problem (Q2908127) (← links)
- Statistical Matching Theory (Q3295266) (← links)
- Subset sums avoiding quadratic nonresidues (Q3543362) (← links)
- Note on the Smallest Root of the Independence Polynomial (Q4903259) (← links)
- Matchings in regular graphs: minimizing the partition function (Q4997230) (← links)
- Markov Random Fields, Homomorphism Counting, and Sidorenko’s Conjecture (Q5040000) (← links)
- Homomorphisms of Trees into a Path (Q5502101) (← links)
- A note on character sums (Q5902349) (← 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)
