Thang Pham | Erdos distinct distances problem, variants, and applications |
Denys Bulavka | A Hilton-Milner theorem for exterior algebras |
Sukumar Das Adhikari | Some elementary algebraic and combinatorial methods in the study of zero-sum theorems |
Jiaxi Nie | On Asymptotic Local Turán Problems |
Martin Balko | Ordered Ramsey numbers: recent progress |
Janos.A. Makowsky | Supercongruences and MC-finiteness of Integer Sequences. |
István Tomon | Dedekind's problem in the hypergrid |
Sylwia Cichacz | On A-cordial trees |
Alexandru Malekshahian | Counting antichains in the Boolean lattice |
Grigory Ivanov | Quantitative Steinitz theorem and polarity. |
Gabriel Currier | Additive structure in convex translates |
Binlong Li | On the edge-color index of rainbow subgraphs |
Gaurav Kucherya | Orientations of graphs with at most one directed path between every pair of vertices |
Yandong Bai | Vertex-disjoint cycles of different lengths in tournaments |
Kenneth Moore | Plane colorings and arithmetic progressions |
Lamar Chidiac | Positroids are 3-colorable |
Zelealem Yilma | The number of spanning trees in 4-regular simple graphs |
Sumin Huang | The maximum sum of the size of all intersections in intersecting families |
Zhihan Jin | The Helly Property for the Hamming Balls |
Dániel Varga | The fractional chromatic number of the plane is at least 4 |
Wei-Tian Li | Antimagic Labeling for Subdivisions of Graphs |
Maria-Romina Ivan | The Turán Density for Daisies and Hypercubes |
John Schmitt | Repeatedly applying the Combinatorial Nullstellensatz for Zero-sum Grids to Martin Gardner’s minimum no-3-in-a-line problem |
Ofelia Cepeda Camargo | A CHARACTERIZATION OF THE SEMITWIN DIGRAPH |
Ferdinand Ihringer | On Boolean Degree 1 Functions (Cameron-Liebler Sets) in Finite Vector Spaces |
Marianna Bolla | Clustering the Vertices of Sparse Edge-Weighted Graphs via Non-Backtracking Spectra |
Attila Sali | Stability results for forbidden configurations |
Sam Spiro | The random Turán problem |
Anurag Bishnoi | Covering grids with multiplicity |
Arsenii Sagdeev | Canonical theorems in Euclidean Ramsey theory |
Matej Stehlik | Criticality in Sperner’s lemma |
Dirk Frettloeh | Perfect colourings of regular graphs |
María del Rocío Sánchez López | Colored reachability in 3-quasi-transitive digraphs |
Ruth Lawrence-Naimark | Combinatorial transverse intersection algebra |
Nika Salia | Linear three-uniform hypergraphs with no Berge path of given length |
Alexander Natalchenko | Monochromatic quadrilaterals in the max-norm plane |
Attila Joó | The Lovász-Cherkassky theorem in infinite graphs |
Carlos Vilchis-Alfaro | Trails in arc-colored digraphs with restriction in the color transitions |
Felipe Hernandez-Lorenzana | A generalization of properly colored paths and cycles in edge-colored graphs |
András Pongrácz | The maximum clique query problem |
Zsolt Langi | On a question of Conway and Guy |
Linda Lesniak | On the existence of (r, g, χ)-graphs and cages |
John Goldwasser | Inducibility in the Hypercube |
Ida Kantor | Metric spaces with many degenerate triangles |
Eng Keat Hng | Characterising flip process rules with the same trajectories |
Anna Margarethe Limbach | Graphon Branching Processes and Fractional Isomorphism |
Yulia Kempner | Violator and Co-Violator Spaces |
Hasmik Sahakyan | IDENTIFICATION OF k-DISTANCE MONOTONE BOOLEAN FUNCTIONS |
Levon Aslanyan | THE DEADLOCK RESOLVING SETS OF KK-MBF CLASS, AND CARDINALITY ESTIMATES |
Aleksa Milojević | Point-variety incidences over arbitrary fields |
Florian Reich | A universal end space theory |
Chaya Keller | Hitting and coloring subsets in geometric hypergraphs |
János Barát | Bounded degree graphs and geometric graph decompositions |
Grzegorz Serafin | Asymptotic normality for subgraph count in random (hyper)graphs |
Ron Holzman | Triangle-free triple systems |
Miklós Ruszinkó | Linear Turán numbers |
David Matula | "(j x i th prime) adj (i x j th prime)": The Fundamental Relation of Arithmetic |
Cory Palmer | A generalized Ramsey-Tur\'an problem |
Shaheen Nazir | Dimension of Splines of Degree 2 |
Anna Taranenko | On vertices of the polytope of polystochastic matrices |
Sam Adriaensen | Circle geometries: Intersecting families and association schemes |
Seonghyuk Im | Dirac's theorem for linear hypergraphs |
Henry Liu | Rainbow cycles through specified vertices |
Thomas Karam | Fourier analysis modulo $p$ on the Boolean cube. |
Neal Bushaw | Thresholds for Zero-Sum Sequences |
Qiuzhenyu Tao | The structure of directed 1-separations in directed graphs with cyclic torsoids |
Pjotr Buys | Reconfiguration of Independent Transversals |
Lajos Hajdu | On arithmetic graphs |
Hilal Hama Karim | Generalized planar Turán numbers related to short cycles |
John Gimbel | Defective Ramsey Numbers for Triangle-free Graphs |
Makoto Ozawa | Forbidden complexes for the 3-sphere |
Daniel Johnston | Rainbow Saturation |
Thilo Krill | Universal graphs with forbidden minors |
Domagoj Bradač | The growth rate of multicolor Ramsey numbers of 3-graphs |
Craig Larson | Conjectures for Paley Graphs |
Aleksa Džuklevski | Some new results concerning polymorphic and σ-morphic monotiles |
Wangyi Shang | Degree conditions restricted to induced Net and Wounded for hamiltonicity of claw-$o$-heavy graphs |
Vladimir Blinovsky | Two Recent Proofs of Theorems for matrices |
Vaidy Sivaraman | Chromatic number: Problems, puzzles, and paradoxes |
Jan Kyncl | Counterexamples to the thrackle conjecture on higher genus surfaces |
Márton Naszódi | Higher rank antipodality |
QINGHAI ZHONG | ON A VARIANT OF THE NARKIEWICZ CONSTANT OF FINITE ABELIAN GROUPS |
Alexander Clifton | Recent Progress on the Odd Cover Problem |
Lorenzo Sauras | On closed forms of C-recursive integer sequences |
Semin Yoo | PALEY-LIKE QUASI-RANDOM GRAPHS ARISING FROM POLYNOMIALS |
Yue Erfei | Results on Bollobás set-pair systems |
Fei Peng | Coprime mappings and lonely runners |
Bojan Basic | Some recent results on the Heesch number in two-dimensional and more-dimensional spaces |
Karl Grill | Some Upper Bounds for Property B |
Puck Rombach | Odd Covers |
Kristina Ago | Axiomatic geometry of Hilbert through the lens of a combinatorist |
George Kontogeorgiou | Small weakly separating path systems for complete graphs |
Glenn Hurlbert | Recent results on the Holroyd-Talbot Conjecture |
Sujoy Bhore | Fully Dynamic Maximum Independent Sets of Disks in Polylogarithmic Update Time |
Francesco Di Braccio | Hamilton decompositions of regular tripartite tournaments |
Nemanja Draganic | Optimal Hamilton covers and linear arboricity for random graphs |
Jeremy Quail | Positroid envelope classes and graphic positroids |
Wouter Cames van Batenburg | Disjoint list-colorings for planar graphs |
Zoltán Lóránt Nagy | Friendly partitions of regular graphs |
Viola Mészáros | Combinatorial Piercing the Chessboard |
Ararat Harutyunyan | Some problems and results on large acyclic sets in digraphs |
Lina Simbaqueba. | Sidorenko-type inequalities for Trees |
Nathan Lemons | Coloring Hypergraphs |
Calum Buchanan | A lower bound on the saturation number and a strengthening for triangle-free graphs |
Jae-baek Lee | Disconnected common graphs via supersaturation |
Van Magnan | A generalization of diversity for intersecting families |
Yixin Cao | Characterization of Chordal Circular-arc Graphs |
Marius Tiba | Sharp stability for the Brunn-Minkowski inequality for arbitrary sets |
Peter van Hintum | Ruzsa's discrete Brunn-Minkowski inequality and locality in sumsets. |
Luke Collins | CHORDS IN LONGEST CYCLES |
Gary Gordon | Subtrees of Graphs |
Ting Lan | Degree powers in graphs forbidding broom forests and double brooms |
Yueping Shi | Star colouring of circulant graphs |
Gergely Kiss | Solutions to the discrete Pompeiu problem and to the finite Steinhaus tiling problem |
József Solymosi | Forbidden patterns among grid-points, hypergraphs and geometric arrangements |
Kartal Nagy | FAMILIES WITH LOWER BOUND ON THE SUM OF PAIRWISE INTERSECTIONS OF TRIPLES |
Liping Yuan | On F-convexity |
Shenggui Zhang | The absence of monochromatic triangles implies various properly colored spanning trees |