Results 131 to 140 of about 46,626 (239)
, 2011 Combinatorics is a fundamental mathematical discipline which focuses on the study of discrete objects and their properties. The current workshop brought together researchers from diverse fields such as Extremal and Probabilistic Combinatorics, Discrete ...
core +2 more sources
Conflict-Free Vertex-Connections of Graphs
Discussiones Mathematicae Graph Theory, 2020 A path in a vertex-colored graph is called conflict-free if there is a color used on exactly one of its vertices. A vertex-colored graph is said to be conflict-free vertex-connected if any two vertices of the graph are connected by a conflict-free path ...
Li Xueliang +5 more
doaj +1 more source
Transforming Solutions for the Oberwolfach Problem into Solutions for the Spouse‐Loving Variant
Journal of Combinatorial Designs, Volume 34, Issue 8, Page 361-377, August 2026.ABSTRACT The Oberwolfach problem OP ( F ), for a 2‐factor F of K n, asks whether there exists a 2‐factorization of K n (if n is odd) or K n − I (if n is even) where each 2‐factor is isomorphic to F. Here, I denotes any 1‐factor of K n. For even n, the problem OP ( F ) may also be denoted OP − ( F ), and has been nicknamed the spouse‐avoiding variant ...
Maruša Lekše, Mateja Šajna
wiley +1 more source
Combinatorics of Free Cumulants
Journal of Combinatorial Theory, Series A, 2000 26 pages ...
Bernadette Krawczyk, Roland Speicher
openaire +3 more sources
On Strongly and Robustly Critical Graphs
Journal of Graph Theory, Volume 112, Issue 4, Page 469-483, August 2026.ABSTRACT In extremal combinatorics, it is common to focus on structures that are minimal with respect to a certain property. In particular, critical and list‐critical graphs occupy a prominent place in graph coloring theory. Stiebitz, Tuza, and Voigt introduced strongly critical graphs, i.e., graphs that are k‐critical yet L‐colorable with respect to ...
Anton Bernshteyn +3 more
wiley +1 more source
, 2014 Combinatorics is a fundamental mathematical discipline which focuses on the study of discrete objects and their properties. The current workshop brought together researchers from diverse fields such as Extremal and Probabilistic Combinatorics, Discrete ...
core +2 more sources
Determinants, choices and combinatorics [PDF]
Discrete Mathematics, 2019 We prove a formula which generalizes both Onn's colorful determinantal formula, related to Rota's basis conjecture, and Svrtan's $n!$ formula, related to the Atiyah-Sutcliffe problem. In some cases, our formula allows us to prove some results similar in spirit to the statement of Rota's basis conjecture.
openaire +2 more sources
Weak, Strong and Mixed Extensions of Relations to Spaces of Ultrafilters
Mathematical Logic Quarterly, Volume 72, Issue 3, August 2026.ABSTRACT The use of nonstandard methods to characterize properties of weak, strong and mixed extensions of congruences to ultrafilters has been the main topic of several recent papers, focused mostly on congruences and divisions. We show that similar methods can be used to extend these characterizations to arbitrary relations and their interplay.
Leonardo Raffaello Maximilian Gasparro +1 more
wiley +1 more source