Diamond Subgraphs in the Reduction Graph of a One-Rule String Rewriting System

10/07/2019
by   Arthur Adinayev, et al.
0

In this paper, we study a certain case of a subgraph isomorphism problem. We consider the Hasse diagram of the lattice M_k (the unique lattice with k+2 elements and one anti-chain of length k) and want to find the maximal k for which it is isomorphic to a subgraph of the reduction graph a given one-rule string rewriting system. We obtain a complete characterization for this problem and show that there is a dichotomy. There are one-rule string rewriting systems for which the maximal such k is 2 and there are cases where there is no maximum. No other intermediate option is possible.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/18/2020

Maximal degrees in subgraphs of Kneser graphs

In this paper, we study the maximum degree in non-empty induced subgraph...
research
09/01/2022

Maximal Closed Substrings

A string is closed if it has length 1 or has a nonempty border without i...
research
09/07/2022

On Plane Subgraphs of Complete Topological Drawings

Topological drawings are representations of graphs in the plane, where v...
research
07/02/2020

Efficient enumeration of maximal split subgraphs and sub-cographs and related classes

In this paper, we are interested in algorithms that take in input an arb...
research
06/01/2018

Block Palindromes: A New Generalization of Palindromes

We propose a new generalization of palindromes and gapped palindromes ca...
research
07/03/2023

Sampling the lattice Nambu-Goto string using Continuous Normalizing Flows

Effective String Theory (EST) represents a powerful non-perturbative app...
research
02/16/2017

Courcelle's Theorem Made Dynamic

Dynamic complexity is concerned with updating the output of a problem wh...

Please sign up or login with your details

Forgot password? Click here to reset