Stop the war!
Остановите войну!
for scientists:
default search action
European Journal of Combinatorics, Volume 115
Volume 115, January 2024
- Édouard Bonnet, Florent Foucaud, Tuomo Lehtilä, Aline Parreau:
Neighbourhood complexity of graphs of bounded twin-width. 103772 - Yang Huang, Yuejian Peng:
Stability of intersecting families. 103774 - Muhuo Liu, Chaohui Chen, Zoran Stanic:
Connected (K4-e)-free graphs whose second largest eigenvalue does not exceed 1. 103775 - Joseph Bernstein, Jessica Striker, Corey Vorland:
P-strict promotion and Q-partition rowmotion: The graded case. 103776 - Yilun Shang:
Rainbow connectivity and rainbow index of inhomogeneous random graphs. 103778 - Vincent Froese, Malte Renken:
Terrain-like graphs and the median Genocchi numbers. 103780 - Stijn Cambie, John Haslegrave, Ross J. Kang:
When removing an independent set is optimal for reducing the chromatic number. 103781 - Alberto Espuny Díaz, Barnabás Janzer, Gal Kronenberg, Joanna Lada:
Long running times for hypergraph bootstrap percolation. 103783 - Ferenc Bencs, Aranka Hrusková, László Márton Tóth:
Factor-of-iid balanced orientation of non-amenable graphs. 103784 - Xun Chen, Qizhong Lin:
New upper bounds for Ramsey numbers of books. 103785 - Maria Chudnovsky, Alex D. Scott, Paul D. Seymour, Sophie Spirkl:
Pure pairs. X. Tournaments and the strong Erdős-Hajnal property. 103786 - Projesh Nath Choudhury, Apoorva Khare:
Distance matrices of a tree: Two more invariants, and in a unified framework. 103787 - Azzurra Ciliberti:
A deletion-contraction long exact sequence for chromatic symmetric homology. 103788 - Stijn Cambie, Wouter Cames van Batenburg, Daniel W. Cranston:
Optimally reconfiguring list and correspondence colourings. 103798 - William Q. Erickson, Jan Kretschmann:
The sum of all width-one matrices. 103799
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.