Results 81 to 90 of about 887,803 (201)
Abundant Neighborhoods, Two‐Sided Markets, and Maximal Matchings
Naval Research Logistics (NRL), Volume 72, Issue 7, Page 1022-1035, October 2025.ABSTRACT I introduce a new graph‐theoretic property called abundant neighborhoods. This property is motivated by studying the thickness of economic markets. A vertex is, roughly, guaranteed to match if and only if it has an abundant neighborhood.
Muhammad Maaz
wiley +1 more source
The Probability That a Random Graph is Even‐Decomposable
Random Structures &Algorithms, Volume 67, Issue 3, October 2025.ABSTRACT A graph G$$ G $$ with an even number of edges is called even‐decomposable if there is a sequence V(G)=V0⊃V1⊃⋯⊃Vk=∅$$ V(G)={V}_0\supset {V}_1\supset \cdots \supset {V}_k=\varnothing $$ such that for each i$$ i $$, G[Vi]$$ G\left[{V}_i\right] $$ has an even number of edges and Vi∖Vi+1$$ {V}_i\setminus \kern0.3em {V}_{i+1} $$ is an independent ...
Oliver Janzer, Fredy Yip
wiley +1 more source
Moments, sums of squares, and tropicalization
Journal of the London Mathematical Society, Volume 112, Issue 4, October 2025.Abstract We use tropicalization to study the duals to cones of nonnegative polynomials and sums of squares on a semialgebraic set S$S$. The truncated cones of moments of measures supported on the set S$S$ are dual to nonnegative polynomials on S$S$, while “pseudomoments” are dual to sums of squares approximations to nonnegative polynomials.
Grigoriy Blekherman +4 more
wiley +1 more source
Power saving for the Brown-Erdős-Sós problem
Discrete AnalysisPower saving for the Brown-Erdős-Sós problem, Discrete Analysis 2025:5, 16 pp. It has long been known that there are important connections between extremal questions concerning hypergraphs and extremal questions in additive combinatorics.
Oliver Janzer +3 more
doaj +1 more source
On extremal problems associated with random chords on a circle
Mathematika, Volume 71, Issue 4, October 2025.Abstract Inspired by the work of Karamata, we consider an extremization problem associated with the probability of intersecting two random chords inside a circle of radius r,r∈(0,1]$r, \, r \in (0,1]$, where the endpoints of the chords are drawn according to a given probability distribution on S1$\mathbb {S}^1$.
Cynthia Bortolotto, João P. G. Ramos
wiley +1 more source
Extremal Combinatorics, Iterated Pigeonhole Arguments and Generalizations of PPP
, 2023 Amol Pasarkar +2 more
openalex +2 more sources
Quasirandom Graphs and the Pantograph Equation. [PDF]
Am Math Mon, 2021 Shapira A, Tyomkyn M.
europepmc +1 more source
Algebras, Graphs and Ordered Sets - ALGOS 2020 & the Mathematical Contributions of Maurice Pouzet. [PDF]
Order (Dordr), 2023 Couceiro M, Duffus D.
europepmc +1 more source
Refuting conjectures in extremal combinatorics via linear programming [PDF]
Journal of Combinatorial Theory, 2019 Adam Zsolt Wagner
semanticscholar +1 more source