


default search action
The Electronic Journal of Combinatorics, Volume 33
Volume 33, Number 1, 2026
- Kristóf Bérczi, Áron Jánosik, Bence Mátravölgyi:

Cyclic Ordering of Split Matroids. - Sergey Norin, Raphael Steiner:

Defective Coloring of Blowups. - Yichen Wang

, Mengyu Cao, Zequn Lv, Mei Lu:
Treewidth of Generalized Hamming Graph, Bipartite Kneser Graph and Generalized Petersen Graph. - Xizhi Liu, Oleg Pikhurko:

A Note on the Minimum Size of Turán Systems. - Alberto Espuny Díaz, Pranshu Gupta, Domenico Mergoni Cecchelli, Olaf Parczyk, Amedeo Sgueglia:

Dirac's Theorem for Graphs of Bounded Bandwidth. - Yuchen Meng:

On Cube-Free Problems. - Aditya Khanna, Nicholas A. Loehr:

A Local Framework for Proving Combinatorial Matrix Inversion Theorems. - Joseph E. Bonin

, Anna de Mier
:
A Construction that Preserves the Configuration of a Matroid, with Applications to Lattice Path Matroids. - Xiongfeng Zhan, Xueyi Huang, Lu Lu:

Fourier Analysis on Distance-Regular Cayley Graphs over Abelian Groups. - Takuya Inoue:

New Bijective Proofs Pertaining to Alternating Sign Matrices. - Jesús A. De Loera, William J. Wesley:

Ramsey Numbers Through the Lenses of Polynomial Ideals and Nullstellensätze. - Veronica Bitonti, Bishal Deb, Alan D. Sokal:

Thron-Type Continued Fractions (T-Fractions) for Some Classes of Increasing Trees. - Natalie C. Behague

, Pawel Pralat, Andrzej Rucinski:
Creating Subgraphs in Semi-Random Hypergraph Games. - Jan Hladký, Daniel Ilkovic, Jared León, Xichao Shu:

On Cospectral Graphons. - Camila Fernández, Matías Pavez-Signé, Maya Stein:

Monochromatic Partitions in 2-Edge-Coloured Bipartite Graphs. - Dániel Gerbner, Hilal Hama Karim, Gaurav Kucheriya

:
On Turán-Type Problems and the Abstract Chromatic Number. - Stijn Cambie

, Wouter Cames van Batenburg, Daniel W. Cranston:
Sharp Bounds on Lengths of Linear Recolouring Sequences. - Xuan Wang

, Tuvi Etzion, Denis S. Krotov, Minjia Shi:
Maximum Size $t$-Intersecting Families and Anticodes. - Federico Firoozi, Jonathan Jedwab, Amarpreet Rattan:

Combinatorial Enumeration of Lattice Paths by Flaws with Respect to a Linear Boundary of Rational Slope. - Ákos Beke:

Resolving Sets and Split Resolving Sets of Symmetric Designs. - Janos Vidali:

Eigenspace Embeddings of Imprimitive Association Schemes. - Hidefumi Ohsugi, Akiyoshi Tsuchiya:

Examining Kempe Equivalence via Commutative Algebra. - Daniel Horsley, Alice Lacaze-Masmonteil:

Completing the Solution of the Directed Oberwolfach Problem with Two Tables. - Zarko Randelovic:

Minimizing the Number of Unions. - Aleksi Saarela, Aleksi Vanhatalo:

A Connection Between Unbordered Partial Words and Sparse Rulers. - William J. Martin, Paul M. Terwilliger:

The Lie Algebra $\mathfrak{sl}_4(\mathbb C)$ and the Hypercubes. - Karolína Hylasová, Tomás Kaiser:

Hypertree Shrinking Avoiding Low Degree Vertices. - Sepehr Hajebi, Sophie Spirkl:

Suns in Triangle-Free Graphs of Large Chromatic Number. - Ruoyu Wang:

Extrema of Local Mean and Local Density in a Tree. - Foster Tom, Aarush Vailaya:

Adjacent Cycle-Chains are $e$-Positive. - Jerónimo Valencia-Porras:

A Combinatorial Proof of an Identity Involving Eulerian Numbers. - Olaf Parczyk, Christoph Spiegel:

An Unsure Note on an Un-Schur Problem. - Stijn Cambie

, François Dross, Kolja Knauer, Hoang La, Petru Valicov:
Partitions of Planar (Oriented) Graphs into a Connected Acyclic and an Independent Set. - Curtis Bright, Amadou Keita, Brett Stevens:

Myrvold's Results on Orthogonal Triples of 10 × 10 Latin Squares: A SAT Investigation. - Benedict Randall Shaw:

New Optima for the Deletion Shadow. - Jacob Fox, Noah Kravitz, Shengtong Zhang:

Finer Control on Relative Sizes of Iterated Sumsets. - Natalie C. Behague

, Debsoumya Chakraborti, Xizhi Liu:
Sabotaging Mantel's Theorem. - Isidoro Gitler, José de Jesús Rodríguez-Ortiz, Guadalupe Rodríguez Sánchez:

On Ribbon Graphs that Admit a Partial Dual of Euler Genus at Most Two. - Josep Díaz, Harrison Hartle, Cristopher Moore:

The Metric Dimension of Sparse Random Graphs. - James Anderson, Abhishek Dhawan

, Aiya Kuchukova:
Coloring Locally Sparse Graphs. - Alin Bostan, Frédéric Chyzak, Vincent Pilaud:

Refined Product Formulas for Tamari Intervals. - Elena Hoster:

The Chow and Augmented Chow Polynomials of Uniform Matroids. - Ross G. Pinsky:

The Distribution on Permutations Induced by a Random Parking Function. - Grigoriy Blekherman, Annie Raymond:

Ubiquity of Power Sums in Graph Profiles. - Anastasia Halfpap, Van Magnan:

Positive Co-Degree Thresholds for Spanning Structures. - Elise Catania:

A Toric Analogue for Greene's Rational Function of a Poset. - Alexandru Pascadi:

The Sparse Regularity Method with Schatten Norms and Entropy. - Dora Woodruff:

Single SEM Schubert Polynomials. - Yue Ma, Xinmin Hou, Zhi Yin:

Generalized Turán Problem with Bounded Matching Number. - José D. Alvarado, Yoshiharu Kohayakawa, Patrick Morris, Guilherme Oliveira Mota:

A Canonical Ramsey Theorem with List Constraints in Random (Hyper-)graphs. - Trung Chau, Huy Tai Ha, Aryaman Maithani:

Minimal Cellular Resolutions of Powers of Graphs. - Kassie Archer, Aaron Geary

, Robert P. Laudone:
Pattern-Avoiding Shallow Permutations. - Sahar Diskin, Joshua Erde, Mihyun Kang, Michael Krivelevich:

Large Matchings and nearly Spanning, nearly Regular Subgraphs of Random Subgraphs. - Jian Zheng, Honghai Li, Yi-Zheng Fan:

Spectral Turán Problems for Nondegenerate Hypergraphs. - P. S. Ardra, Jasine Babu, R. Krithika, Deepak Rajendraprasad:

Color-Constrained Arborescences in Edge-Colored Digraphs. - David J. Hemmer, Armin Straub, Karlee J. Westrem:

New Identities in the Character Table of Symmetric Groups involving Riordan Numbers. - Tung Nguyen, Alexander Scott, Paul D. Seymour:

Distant Digraph Domination. - Marcin Stawiski:

Factorizations of Regular Graphs of Infinite Degree. - Dipayan Chakraborty, Florent Foucaud, Michael A. Henning, Tero Laihonen:

A Note on Partitioning the Vertex Set of a Graph into a Dominating Set and a Locating Dominating Set. - Ho Tin Fan, Alec Sun:

Amending the Lonely Runner Spectrum Conjecture. - Kang-Ju Lee:

A Signed Graph Analogue of Acyclic Orientation Polynomials and the Sink Theorem. - Claudia Marlene de la Cruz, Miguel A. Pizaña:

On Cages and Choosing with Symmetries.

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.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














