Results 111 to 120 of about 37,501 (244)
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
Combinatorics of Periods in Strings
Journal of Combinatorial Theory, Series A, 2001 A preliminary version of this article was published in Lect. Notes Comput. Sci. 2076, 615--626 (2001; Zbl 0986.68101).
Eric Rivals, Sven Rahmann
openaire +6 more sources
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
, 1980 Combinatorics 79. Part II.Includes bibliographical references.Print version record.Front Cover; Annals of Discrete Mathematics Combinatorics 79, Part II; Copyright Page; Contents; Chapter 1. Centers of 2-trees; Chapter 2.
Deza, M., Rosenberg, I. G.(Ivo G.),
core
Combinatorics and connectionism
Discrete Mathematics, 1994 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Combinatorics of Free Cumulants
Journal of Combinatorial Theory, Series A, 2000 26 pages ...
Bernadette Krawczyk, Roland Speicher
openaire +3 more sources
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
Generalized noncrossing partitions and combinatorics of Coxeter groups [PDF]
, 2006 This thesis serves two purposes: it is a comprehensive introduction to the ``Catalan combinatorics'' of finite Coxeter groups, suitable for nonexperts, and it also introduces and studies a new generalization of the poset of noncrossing partitions.
Armstrong, Drew Douglas +1 more
core
AUTOMORPHISM GROUPS OF MAPS, SURFACES AND SMARANDACHE GEOMETRIES [PDF]
, 2011 Automorphism groups survey similarities on mathematical systems, which appear nearly in all mathematical branches, such as those of algebra, combinatorics, geometry, · · · and theoretical physics, theoretical chemistry, etc..
MAO, LINFAN
core +1 more source