default search action
European Journal of Combinatorics, Volume 121
Volume 121, 2024
- Jaroslav Nesetril, Guillem Perarnau, Juanjo Rué, Oriol Serra:
Preface. 103834 - Béla Bajnok, Péter Pál Pach:
On sumsets of nonbases of maximum size. 103835 - Lisa Sauermann:
Rota's basis conjecture holds for random bases of vector spaces. 103836 - Eyal Ackerman, Balázs Keszegh, Dömötör Pálvölgyi:
On tangencies among planar curves with an application to coloring L-shapes. 103837 - Peter Allen, Julia Böttcher, Richard Lang, Jozef Skokan, Maya Stein:
Partitioning a 2-edge-coloured graph of minimum degree 2n/3+o(n) into three monochromatic cycles. 103838 - Man-Kwun Chiu, Stefan Felsner, Manfred Scheucher, Felix Schröder, Raphael Steiner, Birgit Vogtenhuber:
Coloring circle arrangements: New 4-chromatic planar graphs. 103839 - Johann Cigler, Christian Krattenthaler:
Bounded Dyck paths, bounded alternating sequences, orthogonal polynomials, and reciprocity. 103840 - József Balogh, Felix Christian Clemen, Bernard Lidický:
10 problems for partitions of triangle-free graphs. 103841 - Varsha Dani, Josep Díaz, Thomas P. Hayes, Cristopher Moore:
Reconstruction of random geometric graphs: Breaking the Ω(r) distortion barrier. 103842 - Shagnik Das, Charlotte Knierim, Patrick Morris:
Schur properties of randomly perturbed sets. 103843 - Matthew Drescher, Samuel Fiorini, Tony Huynh:
A simple (2+ϵ)-approximation algorithm for Split Vertex Deletion. 103844 - Zdenek Dvorák, Sergey Norin:
Weak diameter coloring of graphs on surfaces. 103845 - Sergi Elizalde:
Descents on nonnesting multipermutations. 103846 - Louis Esperet, David R. Wood:
Colouring strong products. 103847 - Alberto Espuny Díaz, Joseph Hyde:
Powers of Hamilton cycles in dense graphs perturbed by a random geometric graph. 103848
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.