AI Networking Cookbook: Practical recipes for AI-assisted network automation and development
4 papers indexed here
We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.
Not the right person? Other researchers publish under this name.
We show that if a complete binary tree of height $h$ is isomorphic to a subgraph of the strong product of a graph $H$ and a path, then $\mathrm{pw}(H)$ is $\Omega(h)$. This solves a problem posed by Bose, Dujmovi\'c, Javarsineh, Morin, and Wood (2022). The proof was found by OpenAI's GPT-5.6 Sol Pro.
We prove that, for all positive integers $h$ and $t$ and every graph $X$ with $\mathrm{td}(X) \leq h$, there exists a positive integer $c(X,t)$ such that every graph $G$ with $\mathrm{tw}(G)<t$ that excludes $X$ as a topological minor is isomorphic to a subgraph of $H \boxtimes K_{c(X,t)}$ for some graph $H$ with $\mat...
We show that every planar graph has a tree-decomposition with optimal width such that the subgraph induced by each bag has pathwidth at most 3. This bound is best possible, and for tree-decompositions that satisfy a certain minimality condition, we in fact give a precise description of the possible structures in each b...
A vertex-coloring of a graph is centered if every connected subgraph has a vertex with a unique color. A vertex-coloring of a graph is linear if every path in the graph has a vertex with a unique color. Let $\chi_{\mathrm{cen}}(G)$ and $\chi_{\mathrm{lin}}(G)$ be the minimum number of colors in a centered (resp. linear...
We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.