default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEuropean Journal of Combinatorics, Volume 118
Volume 118, 2024
- Shi-Mei Ma, Jun Ma, Jean Yeh
, Yeong-Nan Yeh:
Excedance-type polynomials, gamma-positivity and alternatingly increasing property. 103869 - Donggyu Kim, Sang-il Oum:
Prime vertex-minors of a prime graph. 103871 - József Balogh, Ce Chen, Grace McCourt, Cassie Murley:
Ramsey-Turán problems with small independence numbers. 103872 - Malgorzata Bednarska-Bzdega:
Off-diagonal online size Ramsey numbers for paths. 103873 - Ming-Zhu Chen, A-Ming Liu, Xiao-Dong Zhang:
The spectral radius of minor-free graphs. 103875 - Jean Cardinal, Lionel Pournin, Mario Valencia-Pabon:
The rotation distance of brooms. 103877 - Adam Gowty, Daniel Horsley, Adam Mammoliti:
Minimising the total number of subsets and supersets. 103882 - Peter Frankl, Jian Wang:
Improved bounds on the maximum diversity of intersecting families. 103885 - Victor Falgas-Ravry:
On an extremal problem for locally sparse multigraphs. 103887 - John J. Ebert, David J. Grynkiewicz:
Structure of a sequence with prescribed zero-sum subsequences: Rank two p-groups. 103888 - Gabriel Currier, József Solymosi, Ethan Patrick White:
Additive structure in convex translates. 103889 - Samantha L. Dahlberg, Hemanshu Kaul, Jeffrey A. Mudrock:
An algebraic approach for counting DP-3-colorings of sparse graphs. 103890 - Jonathan S. Bloom, Dan Saracino:
Strictly increasing and decreasing sequences in subintervals of words and a conjecture of Guo and Poznanović. 103898 - Bruce E. Sagan, Joshua P. Swanson:
q-Stirling numbers in type B. 103899 - Richard Ehrenborg:
The Ehrhart and face polynomials of the graph polytope of a cycle. 103906 - Vsevolod F. Lev:
A nonlinear bound for the number of subsequence sums. 103907 - Manoj M. Belavadi, Kathie Cameron, Owen D. Merkel:
Reconfiguration of vertex colouring and forbidden induced subgraphs. 103908 - Tung Nguyen, Alexander Scott, Paul D. Seymour, Stéphan Thomassé:
Clique covers of H-free graphs. 103909 - Karen Meagher, Andriaherimanana Sarobidy Razafimahatratra:
On the intersection density of the Kneser graph K(n,3). 103910 - Sean English, Jürgen Kritschgau, Mina Nahvi, Elizabeth Sprangel:
Saturation numbers for Berge cliques. 103911 - Victor Souza, Leo Versteegen:
Improved bounds for the dimension of divisibility. 103912 - János Barát, Zoltán L. Blázsik:
Improved upper bound on the Frank number of 3-edge-connected graphs. 103913 - Nóra Frankl, Andrey Kupavskii, Arsenii Sagdeev:
Max-norm Ramsey theory. 103918 - Joanna Chybowska-Sokól, Grzegorz Gutowski, Konstanty Junosza-Szaniawski, Patryk Mikos, Adam Polak:
Online coloring of short intervals. 103919 - Takuro Abe, Tan Nhat Tran, Shuhei Tsujie:
Vertex-weighted digraphs and freeness of arrangements between Shi and Ish. 103920 - Zilong Yan, Yuejian Peng:
Bipartite Ramsey numbers of cycles. 103921 - Dhruv Mubayi, Andrew Suk:
Ramsey numbers of cliques versus monotone paths. 103922 - Emma Hogan, Charles Semple:
The excluded minors for the intersection of bicircular and lattice path matroids. 103923 - Matthieu Rosenfeld:
Ann wins the nonrepetitive game over four letters and the erase-repetition game over six letters. 103924 - Daniel Yuschak:
Delta-matroids whose twist polynomials are monomials. 103925 - Xinbu Cheng, Meiqin Wang, Zixiang Xu, Chi Hoi Yip:
Exact values and improved bounds on k-neighborly families of boxes. 103926 - Csaba D. Tóth:
Minimum weight Euclidean (1+ɛ)-spanners. 103927 - Alex Iosevich, Thang Pham, Steven Senger, Michael Tait:
Improved incidence bounds over arbitrary finite fields via the VC-dimension theory. 103928 - Eyal Ackerman, Balázs Keszegh:
On the number of tangencies among 1-intersecting x-monotone curves. 103929 - Dániel Gerbner, Dániel T. Nagy, Balázs Patkós, Nika Salia, Máté Vizer:
Stability of extremal connected hypergraphs avoiding Berge-paths. 103930 - Fadi Awik, Jadyn Breland, Quentin Cadman, Dana C. Ernst:
Braid graphs in simply-laced triangle-free Coxeter systems are partial cubes. 103931 - Michel Rigo, Manon Stipulanti, Markus A. Whiteland:
Characterizations of families of morphisms and words via binomial complexities. 103932 - Iain Moffatt, Maya Thompson:
Deletion-contraction and the surface Tutte polynomial. 103933 - Yahav Alon, Michael Krivelevich:
Hamilton completion and the path cover number of sparse random graphs. 103934 - Sayan Mukherjee:
Extremal numbers of hypergraph suspensions of even cycles. 103935 - Delia Garijo, Andrew J. Goodall, Lluís Vena:
Homomorphisms between graphs embedded in surfaces. 103936 - Thomas Y. He, Kathy Q. Ji, Alice X. H. Zhao:
Overpartitions and Bressoud's conjecture, II. 103937 - Rangel Hernández-Ortiz, Kolja Knauer, Luis Pedro Montejano:
On k-neighborly reorientations of oriented matroids. 103938 - Dustin Cartwright, Dony Varghese:
Characteristic sets of matroids. 103939 - Max Hahn-Klimroth, Olaf Parczyk, Yury Person:
Minimum degree conditions for containing an r-regular r-connected spanning subgraph. 103940 - Jiaao Li, Yongtang Shi, Zhouningxin Wang, Chunyan Wei:
Homomorphisms to small negative even cycles. 103941 - Jarkko Peltomäki:
Initial nonrepetitive complexity of regular episturmian words and their Diophantine exponents. 103942 - Jan De Beule, Jonathan Mannaert, Valentino Smaldore:
Some non-existence results on m-ovoids in classical polar spaces. 103943
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.
last updated on 2026-05-14 00:44 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
