


default search action
European Journal of Combinatorics, Volume 120
Volume 120, 2024
- Ming-Jian Ding
, Bao-Xuan Zhu:
Real stable polynomials and the alternatingly increasing property. 103944 - Matej Trödler, Jan Volec, Jan Vybíral
:
A tight lower bound on the minimal dispersion. 103945 - Konstantin E. Tikhomirov:
A remark on the Ramsey number of the hypercube. 103954 - Debsoumya Chakraborti, Da Qi Chen:
Exact results on generalized Erdős-Gallai problems. 103955 - Maria Axenovich, António Girão, Lawrence Hollom, Julien Portier, Emil Powierski, Michael Savery, Youri Tamitegama, Leo Versteegen:
A note on interval colourings of graphs. 103956 - Amanda Burcroff
:
Near classification of compact hyperbolic Coxeter d-polytopes with d+4 facets and related dimension bounds. 103957 - Mengyu Cao, Mei Lu, Benjian Lv, Kaishun Wang:
Nearly extremal non-trivial cross t-intersecting families and r-wise t-intersecting families. 103958 - Bing He:
Hecke-type series involving infinite products. 103959 - Daniel W. Cranston:
Bounding clique size in squares of planar graphs. 103960 - Jakub Przybylo
:
Bounding the distant irregularity strength of graphs via a non-uniformly biased random weight assignment. 103961 - Kathy Q. Ji, Zhicong Lin:
The binomial-Stirling-Eulerian polynomials. 103962 - Aaron Berger, Nitya Mani
:
On sum-intersecting families of positive integers. 103963 - Brian Alspach, Primoz Sparl:
Cubic factor-invariant graphs of cycle quotient type - The alternating case. 103964 - Seung-Il Choi, Young-Hun Kim
, Young-Tak Oh:
Poset modules of the 0-Hecke algebras and related quasisymmetric power sum expansions. 103965 - Xin Li, Mingqing Zhai, Jinlong Shu:
A Brualdi-Hoffman-Turán problem on cycles. 103966 - Loïc Foissy, Pierre-Louis Giscard, Cécile Mammez:
A co-preLie structure from chronological loop erasure in graph walks. 103967 - Menglong Zhang, Tao Feng
:
A note on non-empty cross-intersecting families. 103968 - Deepak Bal
, Louis DeBiasio, Allan Lo:
A lower bound on the multicolor size-Ramsey numbers of paths in hypergraphs. 103969 - Raphael Steiner:
Coloring hypergraphs with excluded minors. 103971 - Bing Xie, Yigeng Zhao, Yongqiang Zhao:
Special values of spectral zeta functions and combinatorics: Sturm-Liouville problems. 103972 - Manuel Concha, Luc Lapointe:
Symmetry and Pieri rules for the bisymmetric Macdonald polynomials. 103973 - Timothy Sun:
Jungerman ladders and index 2 constructions for genus embeddings of dense regular graphs. 103974 - Jie Han, Lin Sun, Guanghui Wang:
Large Y3,2-tilings in 3-uniform hypergraphs. 103976 - Alexander Natalchenko
, Arsenii Sagdeev:
Monochromatic triangles in the max-norm plane. 103977 - Philip P. Mummert:
Cycles in Austrian Solitaire. 103978 - Ilse Fischer, Florian Schreier-Aigner:
(-1)-enumerations of arrowed Gelfand-Tsetlin patterns. 103979 - Sam Spiro, Erlang Surya:
Counting deranged matchings. 103980 - Jørgen Bang-Jensen
, Yun Wang
:
Arc-disjoint out- and in-branchings in compositions of digraphs. 103981 - Kristina Oganesyan
:
Bounds for the number of multidimensional partitions. 103982 - Gábor Hegedüs, Peter Frankl:
Variations on the Bollobás set-pair theorem. 103983 - António Girão, Robert Hancock:
Two Ramsey problems in blowups of graphs. 103984 - Bernard L. S. Lin, Xiaowei Lin, Lei Zhang:
An identity of Ramanujan and its combinatorics. 103985 - Toby Aldape, Jingyi Liu
, Gregory Pylypovych, Adam Sheffer, Minh-Quan Vo:
Distinct distances in R3 between quadratic and orthogonal curves. 103993 - Colin McDiarmid:
Pendant appearances and components in random graphs from structured classes. 103994 - Serafino Cicerone
, Gabriele Di Stefano, Sandi Klavzar, Ismael G. Yero:
Mutual-visibility problems on graphs of diameter two. 103995 - L'ubomíra Dvoráková, Edita Pelantová:
The repetition threshold of episturmian sequences. 104001 - Csongor Beke, Gergely Kál Csáji, Péter Csikvári, Sára Pituk:
Permutation Tutte polynomial. 104003

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.