default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThe Electronic Journal of Combinatorics, Volume 32
Volume 32, Number 1, 2025
- Kathrin Bringmann, William Craig
, Caner Nazaroglu:
On the Asymptotic Behavior for Partitions Separated by Parity. - Larry Guth, Olivine Silier:
Sharp Szemerédi-Trotter Constructions in the Plane. - Andrew R. Conway, Anthony John Guttmann:
Counting Occurrences of Patterns in Permutations. - Mark A. Skandera, Daniel Soskin:
Permanental Inequalities for Totally Positive Matrices. - Maurício Collares, Sahar Diskin, Joshua Erde, Michael Krivelevich:
Long Cycles in Percolated Expanders. - Matthew Russell:
A Refinement of and a Companion to MacMahon's Partition Identity. - Jiayi Wen:
Demazure Crystals for Flagged Key Polynomials. - Jiangdong Ai, Hong Liu, Zixiang Xu, Qiang Zhou:
Piercing Independent Sets in Graphs without Large Induced Matching. - Eirini Chavli, René Marczinzik:
Homological Algebra of Nakayama Algebras and 321-Avoiding Permutation. - Frédéric Havet, Florian Hörsch, Lucas Picasarri-Arrieta:
The 3-Dicritical Semi-Complete Digraphs. - Reed Acton, T. Kyle Petersen, Blake Shirman, Bridget Eileen Tenner:
The Clairvoyant Maître d'. - Matthias Sowa, Anand Srivastav:
A Constructive Winning Maker Strategy in the Maker-Breaker $C_4$-Game. - Alexander Burstein, Tian Han, Sergey Kitaev, Philip B. Zhang:
On (Shape-)Wilf-Equivalence of Certain Sets of (Partially Ordered) Patterns. - William Linz, Linyuan Lu, Zhiyu Wang:
Maximum Spread of $K_{s,t}$-Minor-Free Graphs. - Patrick Bennett, Ryan Cushman, Andrzej Dudek:
Generalized Ramsey Numbers at the Linear and Quadratic Thresholds. - Eric Marberg:
Kromatic Quasisymmetric Functions. - Joshua Hinman:
Lower Bounds on Face Numbers of Polytopes with $m$ Facets. - Mathew C. Francis, Atrayee Majumder, Rogers Mathew:
Some Bounds on the Threshold Dimension of Graphs. - Jie Han, Lin Sun, Guanghui Wang:
Minimum Degree Conditions for Hamilton $l$-Cycles in $k$-Uniform Hypergraphs. - Andrew C. Brady:
New Strongly Regular Graphs Found via Local Search for Partial Difference Sets. - Fuliang Lu, Jianguo Qian:
Independent Removable Edges in Cubic Bricks. - Xinyu Hu, Qizhong Lin, Jiaxi Nie:
The Number of Edge Colorings with Small Independence Number and No Monochromatic $H$. - Stacie Baumann, Joseph Briggs:
A Proof of the $(n,k,t)$ Conjectures. - Yue Ma, Xinmin Hou, Zhi Yin:
The Degree Threshold for Covering with all the Connected $3$-Graphs with $3$ Edges. - Édouard Bonnet, Carl Feghali, Tung Nguyen, Alex Scott, Paul D. Seymour, Stéphan Thomassé, Nicolas Trotignon:
Graphs without a 3-Connected Subgraph are 4-Colourable. - Stijn Cambie, Jorik Jooken, Jan Goedgebeur:
The Maximum Number of Connected Sets in Regular Graphs. - Olivier Lalonde:
On the Quantum Chromatic Numbers of Small Graphs. - Jiangdong Ai, Pei Liu, Suil O, Junxue Zhang:
The Minimum Spectral Radius of $tP_3$- or $K_5$-Saturated Graphs via the Number of $2$-Walks. - Lin-Peng Zhang, Hajo Broersma, Ligong Wang:
Generalized Crowns in Linear $r$-Graphs. - Alexandr V. Kostochka, Ruth Luo, Grace McCourt:
A Hypergraph Analog of Dirac's Theorem for Long Cycles in 2-Connected Graphs, II: Large Uniformities. - Nathan J. Bowler, Max Pitz:
A Note on Uncountably Chromatic Graphs. - Sayok Chakravarty, Nicholas Spanier:
The Linear $q$-Hypergraph Process. - David I. Bevan, Dan Threlfall:
On the Evolution of Random Integer Compositions. - Ayush Basu, Griffin Johnston, Vojtech Rödl, Marcelo Tadeu Sales:
On Set Representation of Bounded Degree Hypergaphs. - Christoph Helmberg, Guilherme Porto, Guilherme Torres, Vilmar Trevisan:
An Interlacing Property of the Signless Laplacian of Threshold Graphs.
Volume 32, Number 2, 2025
- Jiaao Li, Xueliang Li, Zhiqian Wang:
Every Signed Planar Graph of Girth 5 Has Circular Chromatic Number Strictly Less Than 4. - Sarah Brauner, Galen Dorpalen-Barry, Selvi Kara, Caroline J. Klivans, Lisa Schneider:
A Three-Regime Theorem for Flow-Firing. - Benjamin Adenbaum:
On the Order of P-Strict Promotion on $V\times [\ell]$. - Nick Brettell, Susan Jowett, James G. Oxley, Charles Semple, Geoff Whittle:
What is a $4$-Connected Matroid? - You Lu, Rong Luo, Zhengke Miao, Cun-Quan Zhang:
Signed Circuit $6$-Covers of Signed $K_4$-Minor-Free Graphs. - Allen Herman, Neha Joshi:
Fusions of the Tensor Product of a Strongly Regular Graph. - Bernd Gärtner, Simon Weber, Joel Widmer:
Realizability in Matoušek Unique Sink Orientations: Characterization and Complexity Gap. - Matt Larson:
Rank Functions and Invariants of Delta-Matroids. - Yuantian Yu, Shuchao Li:
On the $A_{\alpha}$-index of $C_4$-free graphs with given order or size. - Vida Dujmovic, Pat Morin, David Wood, David Worley:
Grid Minors and Products. - Alexandru Constantinescu, Patricia Klein, Thái Thành Nguyen, Anurag Singh, Lorenzo Venturello:
Simplicial Complexes and Matroids with Vanishing $T^2$. - Peter J. Cameron, Hiranya Kishore Dey:
On the Order Sequence of a Group. - Michelle Delcourt, Reaz Huq, Pawel Pralat:
Almost All 9-Regular Graphs Have a Modulo-5 Orientation. - Joseph Hyde, Jae-baek Lee, Jonathan A. Noel:
Turán Colourings in Off-Diagonal Ramsey Multiplicity. - Patrick Bennett, Alan M. Frieze:
Weighted Tree Games. - Michela Ascolese, Matthias Lienau, Matthias Schulte, Anusch Taraz:
Randomized Algorithms to Generate Hypergraphs with Given Degree Sequences. - Leslie Hogben, Mark Hunnell, Kevin Liu, Houston Schuerger, Ben Small, Yaqi Zhang:
New Structures and their Applications to Variants of Zero Forcing and Propagation Time. - Yizhe Ji, Wei Wang, Hao Zhang:
Generalized Spectral Characterization of Signed Trees. - Tao Feng, Weicong Li, Qing Xiang:
A New Family of $(q^4+1)$-Tight Sets with an Automorphism Group $F_4(q)$. - Muhuo Liu, Chaohui Chen, Zoran Stanic, Haiying Shan:
Graphs with Large Clique Number whose Second Largest Eigenvalue does not Exceed $(\sqrt{5}-1)/2$. - Patrick Wegener:
Reflection Groups and Quiver Mutation: Diagrammatics. - Patrick Bennett, Andrzej Dudek, Sean English:
A Random Coloring Process Gives Improved Bounds for the Erdős-Gyárfás Problem on Generalized Ramsey Numbers. - Alex Parker:
New Bounds on a Generalization of Tuza's Conjecture. - Ping Xu, Huiqiu Lin, Longfei Fang:
Long Cycles and Spectral Radii in Planar Graphs. - Abhishek Dhawan:
List Colorings of $k$-Partite $k$-Graphs. - Nadia Lafrenière, Rosa Orellana, Anna Pun, Sheila Sundaram, Stephanie van Willigenburg, Tamsen Whitehead McGinley:
The Skew Immaculate Hecke Poset and 0-Hecke Modules. - Vladimir Gurvich, Matjaz Krnc, Martin Milanic, Mikhail N. Vyalyi:
Avoidability Beyond Paths. - Guantao Chen, Songling Shan:
Edge Cover Through Edge Coloring. - Joy Morris, Gabriel Verret:
Detecting Graphical and Digraphical Regular Representations in Groups of Squarefree Order. - Zhenzhen Lou, Changxiang He:
A Max-Min Problem on Spectral Radius and Connectedness of Graphs. - Jean-Luc Baril, Mireille Bousquet-Mélou, Sergey Kirgizov, Mehdi Naima:
The Ascent Lattice on Dyck Paths. - Dermot McCarthy, Chris Monico:
A Mathon-Type Construction for Digraphs and Improved Lower Bounds for Ramsey Numbers. - Ya-nan Zheng:
On the Hyperdeterminants of Steiner Distance Hypermatrices. - Leonardo Nagami Coregliano, Jaroslaw Swaczyna, Agnieszka Widz:
How to Get the Random Graph with Non-Uniform Probabilities? - Miklós Bóna, Stoyan Dimitrov, Gilbert Labelle, Yifei Li, Joseph Pappe, Andrés R. Vindas-Meléndez, Yan Zhuang:
A Combinatorial Proof of a Symmetry for a Refinement of the Narayana Numbers. - Jessica A. Enright, Kitty Meeks, William Pettersson, John Sylvester:
Tangled Paths: A Random Graph Model from Mallows Permutations. - Peter Frankl, Jian Wang:
New Bounds on Families without Large Sunflowers. - Gabriel Currier, Shahriar Shahriari:
3-Cluster-Free Families of Subspaces. - Kevin O'Bryant:
Bounds for Greedy $B_h$-Sets. - Ted Dobson, Ademir Hujdurovic, Klavdija Kutnar, Joy Morris:
Classification of Vertex-Transitive Digraphs of Order a Product of Two Distinct Primes via Automorphism Group. - Igor Araujo, Dadong Peng:
On the Off-Diagonal Unordered Erdős-Rado Numbers. - Seamus P. Albion, Theresia Eisenkölbl, Ilse Fischer, Moritz Gangl, Hans Höngesberg, Christian Krattenthaler, Martin Rubey:
A Generalization of Conjugation of Integer Partitions. - Stéphane Bessy, Johannes Rauch, Dieter Rautenbach, Uéverton S. Souza:
Sparse Vertex Cutsets and the Maximum Degree. - Dieter Rautenbach, Florian Werner:
Degree Deviation and Spectral Radius. - Manoj M. Belavadi, Kathie Cameron, Elias Hildred:
Frozen Colourings in $2K_2$-free graphs. - Nadav Kohen:
Uniform Recurrence in the Motzkin Numbers and Related Sequences mod $p$.
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 2025-07-03 23:53 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:
