Personal

List of Professors [here]

Blogs:

  1. https://gilkalai.wordpress.com
  2. https://gowers.wordpress.com
  3. https://www.quantamagazine.org/tag/combinatorics/
  4. https://yufeizhao.com/blog/
  5. https://igorpak.wordpress.com
  6. https://terrytao.wordpress.com
    https://randomstrasse101.math.ethz.ch

Lecture Notes:


Courses:

Interesting recent papers in Arxiv: [actualizado 30 march]

April

  1. Ramsey numbers for regular induced subgraphs [https://arxiv.org/abs/2604.08215]
  2. On the connected Turán number of Berge paths and Berge cycles [https://arxiv.org/abs/2604.07642]
  3. Coloring powers of random graphs [https://arxiv.org/abs/2604.14006]
  4. New bounds for Ramsey numbers involving graphs with a center [https://arxiv.org/abs/2604.13850]
  5. Reconstructing a graph from its Bell colouring graph [https://arxiv.org/abs/2604.13005]
  6. On the Ramsey numbers of wheels, cycles, and stars [https://arxiv.org/abs/2604.11937]
  7. Edge disjoint Hamilton cycles in random digraphs of constant minimum degree [https://arxiv.org/abs/2604.11633]
  8. Matching and intersection problems for non-trivial r-partite r-uniform hypergraphs [https://arxiv.org/abs/2604.10928]
  9. Erdős-Gyárfás problem for partially ordered sets [https://arxiv.org/abs/2604.10229]
  10. Random 0/1-polytopes expand rapidly [https://arxiv.org/abs/2604.09520]
  11. Sharp threshold for reconstructing points on the line [https://arxiv.org/abs/2604.09176]
  12. Erdős’s diameter conjecture for separated distances fails in high dimensions [https://arxiv.org/abs/2604.15305]
  13. A Hypergraph Container Method on Spread SAT: Approximation and Speedup [https://arxiv.org/abs/2604.15031]
  14. Conflict-free chromatic index of bipartite graphs [https://arxiv.org/pdf/2604.24183]
  15. Counting sunflowers in hypergraphs with bounded matching number and Erdős Matching Conjecture in the (t,k)-norm [https://arxiv.org/abs/2604.19183]
  16. Greedy Routing in a Sequentially Grown One-Dimensional Random Graph [https://arxiv.org/pdf/2604.19733]
  17. Improving the Even-Size Threshold in Spectral Extrema for H(4,3)-Free Graphs [https://arxiv.org/abs/2604.19854]
  18. Intersecting families with bounded intersections [https://arxiv.org/abs/2604.20529]
  19. A resolution of Erdős Problem #190 via Erdős-Lovász, BCT, and Baker-Harman-Pintz [https://arxiv.org/abs/2604.20588]
  20. On the structural growth of bipartite Ramsey numbers [https://arxiv.org/abs/2604.20668]
  21. Sharp bounds for covering with large cliques and independent sets [https://arxiv.org/abs/2604.20962]
  22. Spectral radius and edge-disjoint spanning trees of (k+1)-edge-connected graphs [https://arxiv.org/abs/2604.21470]
  23. A non-existence result for vertex-girth-regular graphs [https://arxiv.org/abs/2604.21486]
  24. On the largest chromatic number of F-free hypergraphs [https://arxiv.org/abs/2604.21551]
  25. Piercing all maximum cliques in hypergraphs [https://arxiv.org/abs/2604.21588]
  26. Extremal 1-planar graphs without k-cliques [https://arxiv.org/abs/2604.21589]
  27. Counting sunflowers with restricted matching number [https://arxiv.org/abs/2604.21855]
  28. Kneser Graphs of Triangulations are Hamiltonian [https://arxiv.org/abs/2604.21888]
  29. Jaeger-type orientations of random regular graphs [https://arxiv.org/abs/2604.22219]
  30. Asymptotically Tight Bound for the Conflict-Free Chromatic Index [https://arxiv.org/abs/2604.22357]
  31. Local Limit of Random Regular Bipartite Planar Maps [https://arxiv.org/abs/2604.24677]


March:

1. On Ramsey Properties of k-Majority Tournaments [https://arxiv.org/pdf/2603.04174]
2. A very robust Ramsey theorem for matchings [https://arxiv.org/pdf/2603.03139]
3.Concentration of the largest induced tree size of Gn,paround the standard expectation threshold [https://arxiv.org/abs/2603.03076]
4. Block-weighted random graphs: planar and beyond [https://arxiv.org/pdf/2602.23912]
5. Combinatorial sufficient conditions for graph rigidity and applications to random graphs [https://arxiv.org/pdf/2602.23713]
6.A step towards the Erdős-Rogers problem [https://arxiv.org/abs/2603.12610]
7. Ordered Ramsey and Turán numbers of alternating paths and their variants [https://arxiv.org/abs/2603.12358]
8. Jacobian graphs [https://arxiv.org/abs/2603.13198]
9. A note on a very abstract chromatic number and extremal problems [https://arxiv.org/abs/2603.11773]
10. Maximum-Entropy Random Walks on Hypergraphs [https://arxiv.org/abs/2603.12098]
11. Semidegree threshold for spanning trees in oriented graphs [https://arxiv.org/abs/2603.10951]
12. New Upper Bounds for the Classical Ramsey Numbers R(4,4,4), R(3,4,5) and R(3,3,6) [https://arxiv.org/abs/2603.10851]
13. Extremal problems in uniformly dense hypergraphs and digraphs [https://arxiv.org/abs/2603.10766]
14. Anti-Ramsey forbidden poset problems [https://arxiv.org/abs/2603.10610]
15. Binomial Random Matroids [https://arxiv.org/abs/2603.10293]
16. Pairwise Negative Correlation for Uniform Spanning Subgraphs of the Complete Graph [https://arxiv.org/abs/2603.10738]
17. Induced subdivisions of Kd+1 in graphs of high girth [https://arxiv.org/abs/2603.09521]
18. The Lovász conjecture holds for moderately dense Cayley graphs [https://arxiv.org/abs/2603.08675]
19. The Exact Erdős-Ko-Rado Theorem for 3-wise t-intersecting uniform families [https://arxiv.org/abs/2603.07991]
20. Spectral bounds for the independence number of graphs and even uniform hypergraphs [https://arxiv.org/abs/2603.07501]
21. An Elementary Proof of the Lovász Local Lemma Without Conditional Probabilities [https://arxiv.org/abs/2603.07245]
22. Clustering without geometry in sparse networks with independent edges [https://arxiv.org/abs/2603.13159]
23. The Bollobás–Nikiforov Conjecture for Complete Multipartite Graphs and Dense K4-Free Graphs [https://arxiv.org/abs/2603.26379]
24. Optimal b-Colourings and Fall Colourings in H-Free Graphs [https://arxiv.org/abs/2603.26214]
25. Ramsey size linear and generalization [https://arxiv.org/abs/2603.25453]
26. Ramsey lower bounds for bounded degree hypergraphs [https://arxiv.org/abs/2603.24627]
27. Two counterexamples to a conjecture about even cycles [https://arxiv.org/abs/2603.24515]
28. On the number of families avoiding a subposet [https://arxiv.org/abs/2603.23431]
29.Frugal colourings of graphs via sparse hypergraph colouring [https://arxiv.org/abs/2603.23379]
30. The complete picture for clique factors in randomly perturbed graphs [https://arxiv.org/abs/2603.22081]
31. Maximum packings in graphs forbidding given rainbow cycles [https://arxiv.org/abs/2603.21260]









February:
1. Minimum Number of Monochromatic Subgraphs of a Random Graph [https://arxiv.org/pdf/2602.03774]
2. On the strength of connectedness of unions of random graphs [https://arxiv.org/abs/2602.02166]
3. A note on multicolour Ramsey numbers and random sphere graphs [https://arxiv.org/abs/2602.02155]

Gap from feb 7 – feb 16

4. Canonical labelling of random regular graphs [https://arxiv.org/pdf/2602.17567]
5. On problems of Erdős and Baumann-Briggs on minimising the density of s-cliques in graphs with forbidden subgraphs [https://arxiv.org/abs/2602.17412]
6. RLGT: A reinforcement learning framework for extremal graph theory [https://arxiv.org/abs/2602.17276]
7. A New Lower Bound for the Diagonal Poset Ramsey Numbers [https://arxiv.org/abs/2602.16556]
8. Extremal t-intersecting families for finite sets with t-covering number at least t+2 [https://arxiv.org/abs/2602.14129]
9. Sidorenko property and forcing in regular tournaments [https://arxiv.org/abs/2602.12551]

February 23-27

10. Most probably trangle-free graphs [https://arxiv.org/pdf/2602.22782]
11. 11. Are sparse graphs typically determined by their spectrum? [https://arxiv.org/pdf/2602.22757]
12. 12. ON THE MAXIMUM NUMBER OF SPANNING TREES IN C4-FREE GRAPHS [https://arxiv.org/pdf/2602.21639]
13. Towards the Erdős matching conjecture for 4-uniform hypergraphs: stability and applications [https://arxiv.org/pdf/2602.19230]
14. A logical approach to concentration [https://arxiv.org/pdf/2602.17752]


January:
1. Thresholds vs. expectation thresholds for non-spanning graphs [https://arxiv.org/pdf/2602.00278]

Electronic Journal of Combinatorics:
Jan 26:
1. Creating Subgraphs in Semi-Random Hypergraph Games [https://www.combinatorics.org/ojs/index.php/eljc/article/view/v33i1p22]
2. Maximum Size t-Intersecting Families and Anticodes [https://www.combinatorics.org/ojs/index.php/eljc/article/view/v33i1p15/pdf]
3. R(3,10) <= 41 [https://www.combinatorics.org/ojs/index.php/eljc/article/view/v32i4p30/pdf]
4. Turán Number for Bushes [https://www.combinatorics.org/ojs/index.php/eljc/article/view/v32i4p55]



Scroll to Top