Results 51 to 60 of about 1,463,977 (153)
Combinatorics Using Computational Methods [PDF]
, 2012 Computational combinatorics involves combining pure mathematics, algorithms, and computational resources to solve problems in pure combinatorics. This thesis provides a theoretical framework for combinatorial search, which is then applied to several ...
Stolee, Derrick
core
Journal of Combinatorial Designs, Volume 34, Issue 10, Page 459-463, October 2026.ABSTRACT Capsets are subsets of F 3 n with no three points on a line, and a capset is complete if it is not a subset of a larger capset. We study some new constructions of capsets via algebraic equations over extensions of F 3. In particular we construct the smallest known complete capsets with size proportional to the best known lower bound.
Cassie Grace, José Felipe Voloch
wiley +1 more source
On the Hardness of Switching to a Small Number of Edges
Journal of Graph Theory, Volume 113, Issue 2, Page 237-251, October 2026.ABSTRACT Seidel's switching is a graph operation which makes a given vertex adjacent to precisely those vertices to which it was non‐adjacent before, while keeping the rest of the graph unchanged. Two graphs are called switching‐equivalent if one can be made isomorphic to the other one by a sequence of switches. Jelínková et al. [DMTCS 13, no. 2, 2011]
Vít Jelínek +2 more
wiley +1 more source
Robustness of the Sauer–Spencer Theorem
Random Structures &Algorithms, Volume 69, Issue 3, October 2026.ABSTRACT We prove a robust version of a graph embedding theorem of Sauer and Spencer. To state this sparser analogue, we define G(p)$$ G(p) $$ to be a random subgraph of G$$ G $$ obtained by retaining each edge of G$$ G $$ independently with probability p∈[0,1]$$ p\in \left[0,1\right] $$, and let m1(H)$$ {m}_1(H) $$ be the maximum 1‐density of a graph ...
Peter Allen +3 more
wiley +1 more source
On the Local Resilience of Random Geometric Graphs With Respect to Connectivity and Long Cycles
Random Structures &Algorithms, Volume 69, Issue 3, October 2026.ABSTRACT Given an increasing graph property 𝒫, a graph G$$ G $$ is α$$ \alpha $$‐resilient with respect to 𝒫 if, for every spanning subgraph H⊆G$$ H\subseteq G $$ where each vertex keeps more than a (1−α)$$ \left(1-\alpha \right) $$‐proportion of its neighbors, H$$ H $$ has property 𝒫.
Alberto Espuny Díaz +2 more
wiley +1 more source
Combinatorics Advances : Papers from a Conference
, 1995 On March 28~31, 1994 (Farvardin 8~11, 1373 by Iranian calendar), the Twenty fifth Annual Iranian Mathematics Conference (AIMC25) was held at Sharif University of Technology in Tehran, Islamic Republic of Iran.
Colbourn, Charles, Mahmoodian, Ebadollah
core +1 more source
Equivalence between Erdős–Hajnal and polynomial Rödl and Nikiforov conjectures
Bulletin of the London Mathematical Society, Volume 58, Issue 10, October 2026.Abstract It is well‐known that polynomial versions of theorems of Rödl and Nikiforov, as conjectured by Fox and Sudakov and Nguyen, Scott and Seymour imply the classical Erdős–Hajnal conjecture. In this note, we prove that these three conjectures are in fact equivalent, extending several previous particular results in this direction by Fox, Nguyen ...
Matija Bucić, Jacob Fox, Huy Tuan Pham
wiley +1 more source
, 2022 Combinatorics is a loosely-organized area of mathematics having to do with counting and optimizing discrete mathematical structures. Topology is an area of mathematics having to do with deforming and distinguishing continuous mathematical structures ...
Matthew Superdock (4934368)
core +1 more source
On automorphism groups of metric reduced products of symmetric groups
Bulletin of the London Mathematical Society, Volume 58, Issue 10, October 2026.Abstract We study isomorphisms between metric reduced products of symmetric groups with the normalized Hamming metric assuming the open coloring axiom OCA${\mathsf {OCA}}$ and Martin's axiom for σ$\sigma$‐linked posets.
Ben De Bondt, Andreas Thom
wiley +1 more source
Universal properties of Delannoy categories
Journal of the London Mathematical Society, Volume 114, Issue 4, October 2026.Abstract Recently, Harman and Snowden introduced a new symmetric tensor category Perm̲(G,μ)$\operatorname{\underline{Perm}}(G, \mu)$ associated with an oligomorphic group G$G$ with a measure μ$\mu$. When G$G$ is the group of order‐preserving self‐bijections of the real line there are four such measures, and the resulting tensor categories are called ...
Kevin Coulembier +2 more
wiley +1 more source