Related papers: Square-free Word-representation of Word-representa…
Graphs that are squares under the gluing algebra arise in the study of homomorphism density inequalities such as Sidorenko's conjecture. Recent work has focused on these homomorphism density applications. This paper takes a new perspective…
For a simple graph $G=(V,E)$, a \emph{proper total weighting} is a mapping $w: V\cup E\rightarrow \mathbb R$ such that for every edge $uv\in E$, $w(u)+\sum_{e\ni u}w(e)\neq w(v)+\sum_{e\ni v}w(e)$. The graph $G$ is said…
String diagrams are a powerful tool for reasoning about composite structures in symmetric monoidal categories. By representing string diagrams as graphs, equational reasoning can be done automatically by double-pushout rewriting. !-graphs…
An element w in the free group on r letters defines a map f from G^r to G for each group G. In this note, we show that whenever w is non-trivial and G is a semisimple algebraic group, f is dominant. When G is a finite simple group, the…
We give a partial answer to a problem of Harju by constructing an infinite ternary squarefree word $w$ with the property that for every $k \geq 3312$ there is an interior length-$k$ factor of $w$ that can be deleted while still preserving…
A set $R\subseteq E(G)$ of a graph $G$ is $k$-removable if $G-R$ has a nowhere-zero $k$-flow. We prove that every graph $G$ admitting a nowhere-zero $4$-flow has a $3$-removable subset consisting of at most $\frac{1}{6}|E(G)|$ edges. This…
Graph is considered neutral if its assortativity coefficient $r$ is equal to zero. In this paper, we address an outstanding conjecture, i.e., whether is there a neutral graph on $n$ vertices? First, we show that for $n\geq7$, there is at…
Let $G = (V, E)$ be a graph and $\lambda $ a non-negative integer. A graph $G$ is called a $(\lambda, 1)$-{\em graph} if $ (c0)$ $G$ is neither a complete graph no an edge-empty graph, $ (c1)$ every edge in $G$ belongs to exactly $\lambda$…
A fork is a graph obtained from $K_{1,3}$ (usually called claw) by subdividing an edge once. A graph is perfectly divisible if for each of its induced subgraph $H$, $V(H)$ can be partitioned into $A$ and $B$ such that $H[A]$ is perfect and…
A square-free word $w$ over a fixed alphabet $\Sigma$ is extremal if every word obtained from $w$ by inserting a single letter from $\Sigma$ (at any position) contains a square. Grytczuk et al. recently introduced the concept of extremal…
For a graph $F$, we say a hypergraph is a Berge-$F$ if it can be obtained from $F$ by replacing each edge of $F$ with a hyperedge containing it. A hypergraph is Berge-$F$-free if it does not contain a subhypergraph that is a Berge-$F$. The…
We construct infinite cubefree binary words containing exponentially many distinct squares of length n. We also show that for every positive integer n, there is a cubefree binary square of length 2n.
A graph $G=(V,E)$ is called $(k,k')$-choosable if for any total list assignment $L$ which assigns to each vertex $v$ a set $L(v)$ of $k$ real numbers, and assigns to each edge $e$ a set $L(e)$ of $k'$ real numbers, there is a mapping…
We present an algebraic characterization of perfect graphs, i.e., graphs for which the clique number and the chromatic number coincide for every induced subgraph. We show that a graph is perfect if and only if certain nonnegative…
Given a set $F$ of words, one associates to each word $w$ in $F$ an undirected graph, called its extension graph, and which describes the possible extensions of $w$ on the left and on the right. We investigate the family of sets of words…
A graph is well-covered if every maximal independent set has the same cardinality. The recognition problem of well-covered graphs is known to be co-NP-complete. Let w be a weight function defined on the vertices of G. Then G is…
Several popular language models represent local contexts in an input text $x$ as bags of words. Such representations are naturally encoded by a sequence graph whose vertices are the distinct words occurring in $x$, with edges representing…
We show that every cubic bridgeless graph G has at least 2^(|V(G)|/3656) perfect matchings. This confirms an old conjecture of Lovasz and Plummer. This version of the paper uses a different definition of a burl from the journal version of…
In this work we consider morphisms that preserve well-known non-repeating properties: squarefreeness, cubefreeness, overlap-freeness and weak squarefreeness. Up to the present moment only the morphisms preserving three out of four…
A graph $G=(V,E)$ is antimagic if there is a one-to-one correspondence $f: E \to \{1,2,\ldots, |E|\}$ such that for any two vertices $u,v$, $\sum_{e \in E(u)}f(e) \ne \sum_{e\in E(v)}f(e)$. It is known that bipartite regular graphs are…