Results 81 to 90 of about 2,178 (219)

Orientations of Graphs With at Most One Directed Path Between Every Pair of Vertices

Journal of Graph Theory, Volume 113, Issue 1, Page 143-164, September 2026.
ABSTRACT Given a graph G, we say that an orientation D of G is a KT orientation if, for all u , v ∈ V ( D ), there is at most one directed path (in any direction) between u and v. Graphs that admit such orientations have been used to construct graphs with large chromatic number and small clique number that served as counterexamples to various ...
Barbora Dohnalová, Jiří Kalvoda, Gaurav Kucheriya, Sophie Spirkl   +3 more
wiley   +1 more source

Sintagmatics vs. Combinatorics: Basic Principles of Combinatorial Linguistics

Научный диалог, 2017
The article is devoted to syntagmatics and combinatorics that form the basis of combinatorial linguistics or science of language which studies linear relations of language units and their combinatorial potential.
M. V. Vlavatskaya
doaj  

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

International Journal of Mathematical Combinatorics, Vol.2A [PDF]

, 2008
The International J.Mathematical Combinatorics (ISSN 1937-1055) is a fully refereed international journal, sponsored by the MADIS of Chinese Academy of Sciences and published in USA quarterly comprising 460 pages approx.
Mao, Linfan (Editor-in-Chief)
core   +1 more source

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, Hemanshu Kaul, Jeffrey A. Mudrock, Gunjan Sharma   +3 more
wiley   +1 more source

Words and Numbers: A Dynamical Systems Perspective

Axioms
Along with some known and less known results, we discuss new insights relating combinatorics of words and the ordering of rationals from a dynamical systems point of view, somehow continuing along the path started in previous works of the first author ...
Stefano Isola, Francesco Marchionni
doaj   +1 more source

On a Ramsey–Turán variant of Roth's theorem

Bulletin of the London Mathematical Society, Volume 58, Issue 8, August 2026.
Abstract A classical theorem of Roth states that the maximum size of a solution‐free set of a homogeneous linear equation L$\mathcal {L}$ in Fp$\mathbb {F}_p$ is o(p)$o(p)$ if and only if the sum of the coefficients of L$\mathcal {L}$ is 0. In this paper, we prove a Ramsey–Turán variant of Roth's theorem, with respect to a natural notion of “structured”
Matija Bucić, Micha Christoph, Jaehoon Kim, Hyunwoo Lee, Varun Sivashankar   +4 more
wiley   +1 more source

Combinatorics on Words and Applications [PDF]

, 2014
This habilitation thesis combines two fields of mathematics – the main one is Combinatorics on Words and combinatorial results are applied in Random Number Generation.
Dvořáková, Lubomíra
core  

Cluster scattering diagrams via quiver moduli and tight gradings

Journal of the London Mathematical Society, Volume 114, Issue 2, August 2026.
Abstract We study rank‐2 cluster scattering diagrams through moduli spaces of quiver representations and a recently developed combinatorial framework of tight gradings. Combining quiver‐theoretic and combinatorial methods, we prove and extend a collection of conjectures posed by Elgin–Reading–Stella concerning the structural and enumerative properties ...
Amanda Burcroff, Kyungyong Lee, Lang Mou, Gregg Musiker, Markus Reineke   +4 more
wiley   +1 more source

Experiments with language combinatorics in text classification: lessons learned and future implications [PDF]

, 2017
This paper presents a meta-analysis of experiments performed with language combinatorics (LC), a novel language model generation and feature extraction method based on combinatorial manipulations of sentence elements (e.g., words).
Masui, Fumito, Ptaszynski, Michal
core   +1 more source