0 | -- | 0 | David Iglesias, Eduardo Lucas. On a Characterization of Lattice Cubes via Discrete Isoperimetric Inequalities |
0 | -- | 0 | Tomoo Matsumura. A Tableau Formula for Vexillary Schubert Polynomials in Type C |
0 | -- | 0 | Maya Stein. Monochromatic Paths in 2-Edge-Coloured Graphs and Hypergraphs |
0 | -- | 0 | Zhenyu Ni, Jing Wang, Liying Kang. Spectral Extremal Graphs for Disjoint Cliques |
0 | -- | 0 | Jan De Beule, Jozefien D'haeseleer, Ferdinand Ihringer, Jonathan Mannaert. Degree 2 Boolean Functions on Grassmann Graphs |
0 | -- | 0 | Sergey V. Avgustinovich, Sergey Kitaev, Anna A. Taranenko. On Five Types of Crucial Permutations with Respect to Monotone Patterns |
0 | -- | 0 | Baptiste Louf, Fiona Skerman. Finding Large Expanders in Graphs: from Topological Minors to Induced Subgraphs |
0 | -- | 0 | Kevin Zhao. On Davenport Constant of the Group $C_2^{r-1} \oplus C_{2k}$ |
0 | -- | 0 | Giuseppe Cotardo, Alberto Ravagnani. Rank-Metric Lattices |
0 | -- | 0 | Antoine Dailly, Laura Eslava, Adriana Hansberg, Denae Ventura. The Balancing Number and Generalized Balancing Number of Some Graph Classes |
0 | -- | 0 | Azzurra Ciliberti, Luca Moci. On Chromatic Symmetric Homology and Planarity of Graphs |
0 | -- | 0 | Grahame Erskine, James Tuite. Small Graphs and Hypergraphs of Given Degree and Girth |
0 | -- | 0 | Binlong Li, Bo Ning 0001. Stability of Woodall's Theorem and Spectral Conditions for Large Cycles |
0 | -- | 0 | David Ellis, Imre Leader, Maria-Romina Ivan. Small Sets in Union-Closed Families |
0 | -- | 0 | Isaac Konan. A Bijective Proof of a Generalization of the Non-Negative Crank-Odd Mex Identity |
0 | -- | 0 | Zachary Hunter. A Result on Large Induced Subgraphs with Prescribed Residues in Bipartite Graphs |
0 | -- | 0 | Clemens Heuberger, Sarah J. Selkirk, Stephan G. Wagner. Enumeration of Generalized Dyck Paths Based on the Height of Down-Steps Modulo $k$ |
0 | -- | 0 | Wei Wang 0052, Wei Wang, Tao Yue 0003. Graphs with at most one Generalized Cospectral Mate |
0 | -- | 0 | Felix Bock, Rafal Kalinowski, Johannes Pardey, Monika Pilsniak, Dieter Rautenbach, Mariusz Wozniak. Majority Edge-Colorings of Graphs |
0 | -- | 0 | Yun Cheng, Yixue Liu, Tomasz Tkocz, Albert Xu. Typical Values of Extremal-Weight Combinatorial Structures with Independent Symmetric Weights |
0 | -- | 0 | Allan Lo, Vincent Pfenninger. Towards Lehel's Conjecture for 4-Uniform Tight Cycles |
0 | -- | 0 | Alan M. Frieze, Wesley Pegden. Multitrees in Random Graphs |
0 | -- | 0 | Irina Ðankovic, Maria-Romina Ivan. Saturation for Small Antichains |
0 | -- | 0 | Jonathan Jedwab, Shuxing Li, Samuel Simon. Constructions and Restrictions for Balanced Splittable Hadamard Matrices |
0 | -- | 0 | Nacho López, Arnau Messegué, Josep M. Miret. Nonexistence of Almost Moore Digraphs of Degrees 4 and 5 with Self-Repeats |
0 | -- | 0 | George Spahn. Counting Baxter Matrices |
0 | -- | 0 | Sergey Kitaev, Artem V. Pyatkin. On Permutations Avoiding Partially Ordered Patterns Defined by Bipartite Graphs |
0 | -- | 0 | Brendan Pawlowski, Eric Ramos, Brendon Rhoades. Spanning Configurations and Representation Stability |
0 | -- | 0 | Nicholas J. Williams. The First Higher Stasheff-Tamari Orders are Quotients of the Higher Bruhat Orders |
0 | -- | 0 | R. Amzi Jeffs. Decompositions of Augmented Bergman Complexes |
0 | -- | 0 | Yuval Filmus. Junta Threshold for Low Degree Boolean Functions on the Slice |
0 | -- | 0 | Manoel Lemos, James G. Oxley. An Upper Bound for the Circumference of a 3-Connected Binary Matroid |
0 | -- | 0 | Sean Eberhard, Freddie Manners. The Apparent Structure of Dense Sidon Sets |
0 | -- | 0 | Stéphane Bessy, Johannes Pardey, Lucas Picasarri-Arrieta, Dieter Rautenbach. Unbalanced Spanning Subgraphs in Edge Labeled Complete Graphs |
0 | -- | 0 | Freddie Illingworth, Emil Powierski, Alex D. Scott, Youri Tamitegama. Balancing Connected Colourings of Graphs |
0 | -- | 0 | Ajani De Vas Gunasekara, Daniel Horsley. Smaller Embeddings of Partial $k$-Star Decompositions |
0 | -- | 0 | Izhak Elmaleh, Ohad N. Feldheim. Min-Cost-Flow Preserving Bijection Between Subgraphs and Orientations |
0 | -- | 0 | Vladislav V. Kabanov. A New Construction of Strongly Regular Graphs with Parameters of the Complement Symplectic Graph |
0 | -- | 0 | Peter Bradshaw. Cooperative Colorings of Forests |
0 | -- | 0 | Hyunsoo Cho, JiSun Huh, Hayan Nam, Jaebum Sohn. Combinatorics on Bounded Free Motzkin Paths and its Applications |
0 | -- | 0 | Eoghan McDowell. Flagged Schur Polynomial Duality via a Lattice Path Bijection |
0 | -- | 0 | Criel Merino. The Number of Quasi-Trees in Fans and Wheels |
0 | -- | 0 | Andrzej Grzesik, Ervin Györi, Nika Salia, Casey Tompkins. Subgraph Densities in $K_r$-Free Graphs |
0 | -- | 0 | Deepak Bal, Patrick Bennett. The Matching Process and Independent Process in Random Regular Graphs and Hypergraphs |
0 | -- | 0 | Zuwen Luo, Kexiang Xu. On the Local and Global Mean Orders of Sub-$k$-Trees of $k$-Trees |
0 | -- | 0 | Antoine Domenech, Pascal Ochem. Doubled Patterns with Reversal and Square-Free Doubled Patterns |
0 | -- | 0 | Dániel Gerbner. Generalized Turán problems for $K_{2,t}$ |
0 | -- | 0 | Sandip Das 0001, Sumitava Ghosh, Swathy Prabhu, Sagnik Sen 0001. A Homomorphic Polynomial for Oriented Graphs |
0 | -- | 0 | Bennet Goeckner, Fran Herr, Legrand Jones, Rowan Rowlands. A Characterization of Two-Dimensional Buchsbaum Matching Complexes |
0 | -- | 0 | Andries E. Brouwer. The Equivalence of Two Inequalities for Quasisymmetric Designs |
0 | -- | 0 | Bishal Deb. Bijection Between Increasing Binary Trees and Rook Placements on Double Staircases |
0 | -- | 0 | James G. Oxley, Jagdeep Singh. Generalizing Cographs to 2-Cographs |
0 | -- | 0 | Radoslav Fulek, Michael J. Pelsmajer, Marcus Schaefer 0001. Hanani-Tutte for Radial Planarity II |
0 | -- | 0 | James A. Long Jr., Kevin G. Milans, Andrea Munaro. Non-Empty Intersection of Longest Paths in $H$-Free Graphs |
0 | -- | 0 | Adam Gregory, Zachary Hamaker. Lenart's Bijection via Bumpless Pipe Dreams |
0 | -- | 0 | Claire Hilaire, Jean-Florent Raymond. Long Induced Paths in Minor-Closed Graph Classes and Beyond |
0 | -- | 0 | Sylwia Antoniuk, Nina Kamcev, Andrzej Rucinski 0001. Properly Colored Hamilton Cycles in Dirac-Type Hypergraphs |