-
Ramsey Problems for Monotone Paths in Graphs and Hypergraphs Combinatorica (IF 1.1) Pub Date : 2024-02-28 Lior Gishboliner, Zhihan Jin, Benny Sudakov
-
The Ungar Games Combinatorica (IF 1.1) Pub Date : 2024-02-21 Colin Defant, Noah Kravitz, Nathan Williams
-
-
An Upper Bound for the Height of a Tree with a Given Eigenvalue Combinatorica (IF 1.1) Pub Date : 2024-02-02 Artūras Dubickas
In this paper we prove that every totally real algebraic integer \(\lambda \) of degree \(d \ge 2\) occurs as an eigenvalue of some tree of height at most \(d(d+1)/2+3\). In order to prove this, for a given algebraic number \(\alpha \ne 0\), we investigate an additive semigroup that contains zero and is closed under the map \(x \mapsto \alpha /(1-x)\) for \(x \ne 1\). The problem of finding the smallest
-
On the Generating Rank and Embedding Rank of the Hexagonic Lie Incidence Geometries Combinatorica (IF 1.1) Pub Date : 2024-01-05
Abstract Given a (thick) irreducible spherical building \(\Omega \) , we establish a bound on the difference between the generating rank and the embedding rank of its long root geometry and the dimension of the corresponding Weyl module, by showing that this difference does not grow when taking certain residues of \(\Omega \) (in particular the residue of a vertex corresponding to a point of the long
-
Euler’s Theorem for Regular CW-Complexes Combinatorica (IF 1.1) Pub Date : 2024-01-05 Richard H. Hammack, Paul C. Kainen
-
A Topological Version of Hedetniemi’s Conjecture for Equivariant Spaces Combinatorica (IF 1.1) Pub Date : 2023-12-19 Vuong Bui, Hamid Reza Daneshpajouh
-
Tight Bound on Treedepth in Terms of Pathwidth and Longest Path Combinatorica (IF 1.1) Pub Date : 2023-12-19
Abstract We show that every graph with pathwidth strictly less than a that contains no path on \(2^b\) vertices as a subgraph has treedepth at most 10ab. The bound is best possible up to a constant factor.
-
Edge-Connectivity and Pairwise Disjoint Perfect Matchings in Regular Graphs Combinatorica (IF 1.1) Pub Date : 2023-12-19 Yulai Ma, Davide Mattiolo, Eckhard Steffen, Isaak H. Wolf
-
A Characterization of Graphs Whose Small Powers of Their Edge Ideals Have a Linear Free Resolution Combinatorica (IF 1.1) Pub Date : 2023-11-27 Nguyen Cong Minh, Thanh Vu
Let I(G) be the edge ideal of a simple graph G. We prove that \(I(G)^2\) has a linear free resolution if and only if G is gap-free and \({{\,\textrm{reg}\,}}I(G) \le 3\). Similarly, we show that \(I(G)^3\) has a linear free resolution if and only if G is gap-free and \({{\,\textrm{reg}\,}}I(G) \le 4\). We deduce these characterizations by establishing a general formula for the regularity of powers
-
A Group Ring Approach to Fuglede’s Conjecture in Cyclic Groups Combinatorica (IF 1.1) Pub Date : 2023-11-27 Tao Zhang
Fuglede’s conjecture states that a subset \(\Omega \subseteq \mathbb {R}^{n}\) with positive and finite Lebesgue measure is a spectral set if and only if it tiles \(\mathbb {R}^{n}\) by translation. However, this conjecture does not hold in both directions for \(\mathbb {R}^n\), \(n\ge 3\). While the conjecture remains unsolved in \(\mathbb {R}\) and \(\mathbb {R}^2\), cyclic groups are instrumental
-
Universal Planar Graphs for the Topological Minor Relation Combinatorica (IF 1.1) Pub Date : 2023-11-21 Florian Lehner
-
Tiling Edge-Coloured Graphs with Few Monochromatic Bounded-Degree Graphs Combinatorica (IF 1.1) Pub Date : 2023-11-21 Jan Corsten, Walner Mendonça
-
Kempe Equivalent List Colorings Combinatorica (IF 1.1) Pub Date : 2023-11-16 Daniel W. Cranston, Reem Mahmoud
-
A Book Proof of the Middle Levels Theorem Combinatorica (IF 1.1) Pub Date : 2023-11-06 Torsten Mütze
-
On Unique Sums in Abelian Groups Combinatorica (IF 1.1) Pub Date : 2023-11-01 Benjamin Bedert
Let A be a subset of the cyclic group \({\textbf{Z}}/p{\textbf{Z}}\) with p prime. It is a well-studied problem to determine how small |A| can be if there is no unique sum in \(A+A\), meaning that for every two elements \(a_1,a_2\in A\), there exist \(a_1',a_2'\in A\) such that \(a_1+a_2=a_1'+a_2'\) and \(\{a_1,a_2\}\ne \{a_1',a_2'\}\). Let m(p) be the size of a smallest subset of \({\textbf{Z}}/p{\textbf{Z}}\)
-
Sweeps, Polytopes, Oriented Matroids, and Allowable Graphs of Permutations Combinatorica (IF 1.1) Pub Date : 2023-10-23 Arnau Padrol, Eva Philippe
-
A Structural Theorem for Sets with Few Triangles Combinatorica (IF 1.1) Pub Date : 2023-10-12 Sam Mansfield, Jonathan Passant
-
On the Maximum of the Sum of the Sizes of Non-trivial Cross-Intersecting Families Combinatorica (IF 1.1) Pub Date : 2023-10-12 P. Frankl
Let \(n \ge 2k \ge 4\) be integers, \({[n]\atopwithdelims ()k}\) the collection of k-subsets of \([n] = \{1, \ldots , n\}\). Two families \({\mathcal {F}}, {\mathcal {G}} \subset {[n]\atopwithdelims ()k}\) are said to be cross-intersecting if \(F \cap G \ne \emptyset \) for all \(F \in {\mathcal {F}}\) and \(G \in {\mathcal {G}}\). A family is called non-trivial if the intersection of all its members
-
A Solution to Babai’s Problems on Digraphs with Non-diagonalizable Adjacency Matrix Combinatorica (IF 1.1) Pub Date : 2023-09-29 Yuxuan Li, Binzhou Xia, Sanming Zhou, Wenying Zhu
The fact that the adjacency matrix of every finite graph is diagonalizable plays a fundamental role in spectral graph theory. Since this fact does not hold in general for digraphs, it is natural to ask whether it holds for digraphs with certain level of symmetry. Interest in this question dates back to the early 1980 s, when P. J. Cameron asked for the existence of arc-transitive digraphs with non-diagonalizable
-
Value Distributions of Perfect Nonlinear Functions Combinatorica (IF 1.1) Pub Date : 2023-09-29 Lukas Kölsch, Alexandr Polujan
In this paper, we study the value distributions of perfect nonlinear functions, i.e., we investigate the sizes of image and preimage sets. Using purely combinatorial tools, we develop a framework that deals with perfect nonlinear functions in the most general setting, generalizing several results that were achieved under specific constraints. For the particularly interesting elementary abelian case
-
A Generalization of the Chevalley–Warning and Ax–Katz Theorems with a View Towards Combinatorial Number Theory Combinatorica (IF 1.1) Pub Date : 2023-09-29 David J. Grynkiewicz
-
Induced Subgraphs of Induced Subgraphs of Large Chromatic Number Combinatorica (IF 1.1) Pub Date : 2023-09-25 António Girão, Freddie Illingworth, Emil Powierski, Michael Savery, Alex Scott, Youri Tamitegama, Jane Tan
We prove that, for every graph F with at least one edge, there is a constant \(c_F\) such that there are graphs of arbitrarily large chromatic number and the same clique number as F in which every F-free induced subgraph has chromatic number at most \(c_F\). This generalises recent theorems of Briański, Davies and Walczak, and Carbonero, Hompe, Moore and Spirkl. Our results imply that for every \(r\geqslant
-
Effective Results on the Size and Structure of Sumsets Combinatorica (IF 1.1) Pub Date : 2023-09-18 Andrew Granville, George Shakan, Aled Walker
Let \(A \subset {\mathbb {Z}}^d\) be a finite set. It is known that NA has a particular size (\(\vert NA\vert = P_A(N)\) for some \(P_A(X) \in {\mathbb {Q}}[X]\)) and structure (all of the lattice points in a cone other than certain exceptional sets), once N is larger than some threshold. In this article we give the first effective upper bounds for this threshold for arbitrary A. Such explicit results
-
Integer Multiflows in Acyclic Planar Digraphs Combinatorica (IF 1.1) Pub Date : 2023-09-19 Guyslain Naves
-
Polynomial Bounds for Chromatic Number. IV: A Near-polynomial Bound for Excluding the Five-vertex Path Combinatorica (IF 1.1) Pub Date : 2023-09-15 Alex Scott, Paul Seymour, Sophie Spirkl
A graph G is H-free if it has no induced subgraph isomorphic to H. We prove that a \(P_5\)-free graph with clique number \(\omega \ge 3\) has chromatic number at most \(\omega ^{\log _2(\omega )}\). The best previous result was an exponential upper bound \((5/27)3^{\omega }\), due to Esperet, Lemoine, Maffray, and Morel. A polynomial bound would imply that the celebrated Erdős-Hajnal conjecture holds
-
Prague Dimension of Random Graphs Combinatorica (IF 1.1) Pub Date : 2023-09-06 He Guo, Kalen Patton, Lutz Warnke
-
The Strong Nine Dragon Tree Conjecture is True for $$d \le k + 1$$ Combinatorica (IF 1.1) Pub Date : 2023-08-21 Sebastian Mies, Benjamin Moore
-
On Bounded Degree Graphs with Large Size-Ramsey Numbers Combinatorica (IF 1.1) Pub Date : 2023-08-21 Konstantin Tikhomirov
-
A Characterization of Edge-Ordered Graphs with Almost Linear Extremal Functions Combinatorica (IF 1.1) Pub Date : 2023-08-18 Gaurav Kucheriya, Gábor Tardos
-
Separating Polynomial $$\chi $$ -Boundedness from $$\chi $$ -Boundedness Combinatorica (IF 1.1) Pub Date : 2023-08-09 Marcin Briański, James Davies, Bartosz Walczak
Extending the idea from the recent paper by Carbonero, Hompe, Moore, and Spirkl, for every function \(f:\mathbb {N}\rightarrow \mathbb {N}\cup \{\infty \}\) with \(f(1)=1\) and \(f(n)\geqslant \left( {\begin{array}{c}3n+1\\ 3\end{array}}\right) \), we construct a hereditary class of graphs \({\mathcal {G}}\) such that the maximum chromatic number of a graph in \({\mathcal {G}}\) with clique number
-
Stability Through Non-Shadows Combinatorica (IF 1.1) Pub Date : 2023-08-04 Jun Gao, Hong Liu, Zixiang Xu
We study families \({\mathcal {F}}\subseteq 2^{[n]}\) with restricted intersections and prove a conjecture of Snevily in a stronger form for large n. We also obtain stability results for Kleitman’s isodiametric inequality and families with bounded set-wise differences. Our proofs introduce a new twist to the classical linear algebra method, harnessing the non-shadows of \({\mathcal {F}}\), which may
-
Weak Saturation of Multipartite Hypergraphs Combinatorica (IF 1.1) Pub Date : 2023-07-27 Denys Bulavka, Martin Tancer, Mykhaylo Tyomkyn
Given q-uniform hypergraphs (q-graphs) F, G and H, where G is a spanning subgraph of F, G is called weakly H-saturated in F if the edges in \(E(F)\setminus E(G)\) admit an ordering \(e_1,\ldots , e_k\) so that for all \(i\in [k]\) the hypergraph \(G\cup \{e_1,\ldots ,e_i\}\) contains an isomorphic copy of H which in turn contains the edge \(e_i\). The weak saturation number of H in F is the smallest
-
A Necessary and Sufficient Condition for $$(2d-2)$$ -Transversals in $$\mathbb {R}^{2d}$$ Combinatorica (IF 1.1) Pub Date : 2023-07-27 Daniel McGinnis
-
A Factor Matching of Optimal Tail Between Poisson Processes Combinatorica (IF 1.1) Pub Date : 2023-07-25 Ádám Timár
Consider two independent Poisson point processes of unit intensity in the Euclidean space of dimension d at least 3. We construct a perfect matching between the two point sets that is a factor (i.e., a measurable function of the point configurations that commutes with translations), and with the property that the distance between two matched configuration points has a tail distribution that decays
-
Spherical Two-Distance Sets and Eigenvalues of Signed Graphs Combinatorica (IF 1.1) Pub Date : 2023-07-21 Zilin Jiang, Jonathan Tidor, Yuan Yao, Shengtong Zhang, Yufei Zhao
-
Pure Pairs. V. Excluding Some Long Subdivision Combinatorica (IF 1.1) Pub Date : 2023-06-16 Alex Scott, Paul Seymour, Sophie Spirkl
-
A combinatorial proof of a sumset conjecture of Furstenberg Combinatorica (IF 1.1) Pub Date : 2023-06-14 Daniel Glasscock, Joel Moreira, Florian K. Richter
We give a new proof of a sumset conjecture of Furstenberg that was first proved by Hochman and Shmerkin in 2012: if \(\log r/\log s\) is irrational and X and Y are \(\times r\) - and \(\times s\)-invariant subsets of [0, 1], respectively, then \(\dim _{\text {H}}(X + Y ) = \min (1, \dim _{\text {H}}X + \dim _{\text {H}}Y )\). Our main result yields information on the size of the sumset \(\lambda X
-
Maximal 3-Wise Intersecting Families Combinatorica (IF 1.1) Pub Date : 2023-06-13 József Balogh, Ce Chen, Kevin Hendrey, Ben Lund, Haoran Luo, Casey Tompkins, Tuan Tran
A family \({\mathcal {F}}\) on ground set \([n]:=\{1,2,\ldots , n\}\) is maximal k-wise intersecting if every collection of at most k sets in \({\mathcal {F}}\) has non-empty intersection, and no other set can be added to \({\mathcal {F}}\) while maintaining this property. In 1974, Erdős and Kleitman asked for the minimum size of a maximal k-wise intersecting family. We answer their question for \(k=3\)
-
The Asymptotic Number of Score Sequences Combinatorica (IF 1.1) Pub Date : 2023-06-13 Brett Kolesnik
-
A Large Family of Maximum Scattered Linear Sets of $${{\,\mathrm{{PG}}\,}}(1,q^n)$$ and Their Associated MRD Codes Combinatorica (IF 1.1) Pub Date : 2023-06-13 G. Longobardi, Giuseppe Marino, Rocco Trombetti, Yue Zhou
Linear sets in projective spaces over finite fields were introduced by Lunardon (Geom Dedic 75(3):245–261, 1999) and they play a central role in the study of blocking sets, semifields, rank-metric codes, etc. A linear set with the largest possible cardinality and rank is called maximum scattered. Despite two decades of study, there are only a limited number of maximum scattered linear sets of a line
-
Enclosing Depth and Other Depth Measures Combinatorica (IF 1.1) Pub Date : 2023-06-13 Patrick Schnider
-
A Recursive Theta Body for Hypergraphs Combinatorica (IF 1.1) Pub Date : 2023-06-13 Davi Castro-Silva, Fernando Mário de Oliveira Filho, Lucas Slot, Frank Vallentin
-
An Improved Bound for the Linear Arboricity Conjecture Combinatorica (IF 1.1) Pub Date : 2023-06-13 Richard Lang, Luke Postle
-
$$\Gamma $$ -Graphic Delta-Matroids and Their Applications Combinatorica (IF 1.1) Pub Date : 2023-06-13 Donggyu Kim, Duksang Lee, Sang-il Oum
-
A Unifying Framework for the $$\nu $$ -Tamari Lattice and Principal Order Ideals in Young’s Lattice Combinatorica (IF 1.1) Pub Date : 2023-06-13 Matias von Bell, Rafael S. González D’León, Francisco A. Mayorga Cetina, Martha Yip
-
The Chromatic Number of the Product of 5-Chromatic Graphs can be 4 Combinatorica (IF 1.1) Pub Date : 2023-06-12 Claude Tardif
-
Strongly Regular Graphs Satisfying the 4-Vertex Condition Combinatorica (IF 1.1) Pub Date : 2023-06-05 A. E. Brouwer, F. Ihringer, W. M. Kantor
We survey the area of strongly regular graphs satisfying the 4-vertex condition and find several new families. We describe a switching operation on collinearity graphs of polar spaces that produces cospectral graphs. The obtained graphs satisfy the 4-vertex condition if the original graph belongs to a symplectic polar space.
-
Growth in Sumsets of Higher Convex Functions Combinatorica (IF 1.1) Pub Date : 2023-06-05 Peter J. Bradshaw
The main results of this paper concern growth in sums of a k-convex function f. Firstly, we streamline the proof (from Hanson et al. (Combinatorica 42:71–85, 2020)) of a growth result for f(A) where A has small additive doubling, and improve the bound by removing logarithmic factors. The result yields an optimal bound for $$\begin{aligned} |2^k f(A) - (2^k-1)f(A)|. \end{aligned}$$ We also generalise
-
Leray Numbers of Tolerance Complexes Combinatorica (IF 1.1) Pub Date : 2023-06-05 Minki Kim, Alan Lew
-
The Number of Tangencies Between Two Families of Curves Combinatorica (IF 1.1) Pub Date : 2023-06-05 Balázs Keszegh, Dömötör Pálvölgyi
-
A Local Version of Katona’s Intersecting Shadow Theorem Combinatorica (IF 1.1) Pub Date : 2023-06-05 Marcelo Sales, Bjarne Schülke
Katona’s intersection theorem states that every intersecting family \(\mathcal {F}\subseteq [n]^{(k)}\) satisfies \(\vert \partial \mathcal {F}\vert \geqslant \vert \mathcal {F}\vert \), where \(\partial \mathcal {F}=\{F\setminus \{x\}:x\in F\in \mathcal {F}\}\) is the shadow of \(\mathcal {F}\). Frankl conjectured that for \(n>2k\) and every intersecting family \(\mathcal {F}\subseteq [n]^{(k)}\)
-
Bounded Cutoff Window for the Non-backtracking Random Walk on Ramanujan Graphs Combinatorica (IF 1.1) Pub Date : 2023-06-05 Evita Nestoridi, Peter Sarnak
We prove that the non-backtracking random walk on Ramanujan graphs with large girth exhibits the fastest possible cutoff with a bounded window.
-
Asymptotics of the Hypergraph Bipartite Turán Problem Combinatorica (IF 1.1) Pub Date : 2023-05-26 Domagoj Bradač, Lior Gishboliner, Oliver Janzer, Benny Sudakov
For positive integers s, t, r, let \(K_{s,t}^{(r)}\) denote the r-uniform hypergraph whose vertex set is the union of pairwise disjoint sets \(X,Y_1,\dots ,Y_t\), where \(|X| = s\) and \(|Y_1| = \dots = |Y_t| = r-1\), and whose edge set is \(\{\{x\} \cup Y_i: x \in X, 1\le i\le t\}\). The study of the Turán function of \(K_{s,t}^{(r)}\) received considerable interest in recent years. Our main results
-
A Positive Answer to Bárány’s Question on Face Numbers of Polytopes Combinatorica (IF 1.1) Pub Date : 2023-05-26 Joshua Hinman
-
Voltage Operations on Maniplexes, Polytopes and Maps Combinatorica (IF 1.1) Pub Date : 2023-05-25 Isabel Hubard, Elías Mochán, Antonio Montero
-
Upper Bounds For Families Without Weak Delta-Systems Combinatorica (IF 1.1) Pub Date : 2023-05-24 Eric Naslund
For \(k\ge 3\), a collection of k sets is said to form a weak \(\Delta \)-system if the intersection of any two sets from the collection has the same size. Erdős and Szemerédi asked about the size of the largest family \(\mathcal {F}\) of subsets of \(\{1,\dots ,n\}\) that does not contain a weak \(\Delta \)-system. In this note we improve upon the best upper bound due to the author and Sawin, and
-
Balanced Subdivisions of Cliques in Graphs Combinatorica (IF 1.1) Pub Date : 2023-05-23 Bingyu Luan, Yantao Tang, Guanghui Wang, Donglei Yang
-
Counting Hamilton Cycles in Dirac Hypergraphs Combinatorica (IF 1.1) Pub Date : 2023-05-23 Asaf Ferber, Liam Hardiman, Adva Mond
For \(0\le \ell 1/2\) has (asymptotically and up to a subexponential factor) at least as many Hamilton \(\ell \)-cycles as a typical random k-graph with edge-probability \(\delta \). This significantly improves a recent result of Glock, Gould, Joos, Kühn and Osthus, and verifies a conjecture of Ferber, Krivelevich and Sudakov for all values \(0\le \ell
-
On the Density of Critical Graphs with No Large Cliques Combinatorica (IF 1.1) Pub Date : 2023-05-23 Tom Kelly, Luke Postle