Results 51 to 60 of about 1,252 (172)

On the Hardness of Switching to a Small Number of Edges

Journal of Graph Theory, EarlyView.
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, Eva Jelínková, Jan Kratochvíl   +2 more
wiley   +1 more source

Random multilinear maps and the Erdős box problem

Discrete Analysis, 2021
Random multilinear maps and the Erdős box problem, Discrete Analysis 2021:17, 8 pp. A major theme in extremal combinatorics is determining the maximum number of edges that a graph or hypergraph can have if it does not contain a certain fixed graph or ...
David Conlon, Cosmin Pohoata, Dmitriy Zakharov   +2 more
doaj   +1 more source

On the Contribution of WORDS to the Field of Combinatorics on Words [PDF]

, 2015
We propose some notes about the history and the features of the conference WORDS, our goal being to testify how the conference may be embedded in the development of the field of Combinatorics on Words.
openaire   +2 more sources

Combinatorics on partial word correlations

Journal of Combinatorial Theory, Series A, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Francine Blanchet-Sadri, Justin Fowler, Joshua D. Gafni, Kevin H. Wilson   +3 more
openaire   +1 more source

Linear Versus Centred Colouring via Pseudogrids

Journal of Graph Theory, EarlyView.
ABSTRACT A centred colouring of a graph is a vertex colouring in which every connected subgraph contains a vertex whose colour is unique and a linear colouring is a vertex colouring in which every (not‐necessarily induced) path contains a vertex whose colour is unique. For a graph G $G$, the centred chromatic number χ cen ( G ) ${\chi }_{\text{cen}}(G)$
Prosenjit Bose, Vida Dujmović, Hussein Houdrouge, Mehrnoosh Javarsineh, Pat Morin   +4 more
wiley   +1 more source

On an Algorithm for Multiperiodic Words

Acta Polytechnica, 2013
We consider an algorithm by Tijdeman and Zamboni constructing a word of length k thathas periods p1, . . . , pr, and the richest possible alphabet.
Štepán Holub
doaj  

Forbidden intersection problems for families of linear maps

Discrete Analysis, 2023
Forbidden intersection problems for families of linear maps, Discrete Analysis 2023:19, 32 pp. A central problem in extremal combinatorics is to determine the maximal size of a set system given constraints on the sizes of the sets in the system and on ...
David Ellis, Guy Kindler, Noam Lifshitz
doaj   +1 more source

On Fork‐Free t‐Perfect Graphs

Journal of Graph Theory, EarlyView.
ABSTRACT In an effort to understand the complexity of the maximum independent set problem, Chvátal introduced t‐perfect graphs. While a full characterization of this class remains open, important progress has been made for claw‐free graphs [Bruhn and Stein, Math. Program. 2012] and P 5 ${P}_{5}$‐free graphs [Bruhn and Fuchs, SIAM J. Discrete Math. 2017]
Yixin Cao, Shenghua Wang
wiley   +1 more source

Shuffle Product Formulas and Combinatorial Identities

Mathematics
We study shuffle product structures on words in three letters, extending the classical framework of multiple zeta values. Using an evaluation map that relates admissible words to iterated integrals, we translate shuffle identities into combinatorial ...
Kwang-Wu Chen
doaj   +1 more source

Tree Independence Number III. Thetas, Prisms and Stars

Journal of Graph Theory, EarlyView.
ABSTRACT We prove that for every t ∈ N $t\in {\mathbb{N}}$ there exists τ = τ ( t ) ∈ N $\tau =\tau (t)\in {\mathbb{N}}$ such that every (theta, prism, K 1 , t ${K}_{1,t}$)‐free graph has tree independence number at most τ $\tau $ (where we allow “prisms” to have one path of length zero).
Maria Chudnovsky, Sepehr Hajebi, Nicolas Trotignon   +2 more
wiley   +1 more source