相关论文: Universal graphs with forbidden subgraphs and alge…
We study some versions of the statement of Hadwiger's conjecture for finite as well as infinite graphs.
Motivated by the remarkable interplay between (chordal) graphs and matrix algebra, we associate to each graph a so-called completion number that might encode some aspects of that interplay. We show that this number is not trivial, and we…
The present work aims to exploit the interplay between the algebraic properties of rings and the graph-theoretic structures of their associated graphs. We introduce commutatively closed graphs and investigate properties of commutatively…
We present an algebraic algorithm to detect the existence of and to list all indecomposable even circuits in a given graph. We also discuss an application of our work to the study of directed cycles in digraphs.
We give a series of new lower bounds on the minimum number of vertices required by a graph to contain every graph of a given family as induced subgraph. In particular, we show that this induced-universal graph for $n$-vertex planar graphs…
We say that a nonselfadjoint operator algebra is partly free if it contains a free semigroup algebra. Motivation for such algebras occurs in the setting of what we call free semigroupoid algebras. These are the weak operator topology closed…
Our main result is a sharp bound for the number of vertices in a minimal forbidden subgraph for the graphs having minimum rank at most 3 over the finite field of order 2. We also list all 62 such minimal forbidden subgraphs. We conclude by…
A class $\mathcal{G}$ of graphs is hereditary if it is closed under taking induced subgraphs. We investigate the edge-add class, $\mathcal{G}^{\mathrm{add}}$, consisting of graphs that can be made members of $\mathcal{G}$ by adding at most…
Starting from a supercompact cardinal we build a model in which $2^{\aleph_{\omega_1}}=2^{\aleph_{\omega_1+1}}=\aleph_{\omega_1+3}$ but there is a jointly universal family of size $\aleph_{\omega_1+2}$ of graphs on $\aleph_{\omega_1+1}$.…
We discuss topological versions of the closed graph theorem, where continuity is inferred from near continuity in tandem with suitable conditions on source or target spaces. We seek internal characterizations of spaces satisfying a closed…
A (finite or infinite) graph is called constructible if it may be obtained recursively from the one-point graph by repeatedly adding dominated vertices. In the finite case, the constructible graphs are precisely the cop-win graphs, but for…
Inspired by notorious combinatorial optimization problems on graphs, in this paper we consider a series of related problems defined using a metric space and topology determined by a graph. Particularly, we present the Independent Set,…
Graphs constructed to translate some graph problem into another graph problem are usually called auxiliary graphs. Specifically total graphs of simple graphs are used to translate the total colouring problem of the original graph into a…
A fundamental theorem in graph theory states that any 3-connected graph contains a subdivision of $K_4$. As a generalization, we ask for the minimum number of $K_4$-subdivisions that are contained in every $3$-connected graph on $n$…
This work studies certain aspects of graphs embedded on surfaces. Initially, a colored graph model for a map of a graph on a surface is developed. Then, a concept analogous to (and extending) planar graph is introduced in the same spirit as…
A graph $U$ is universal for a graph class $\mathcal{C}\ni U$, if every $G\in \mathcal{C}$ is a minor of $U$. We prove the existence or absence of universal graphs in several natural graph classes, including graphs component-wise embeddable…
Problems related to finding induced subgraphs satisfying given properties form one of the most studied areas within graph algorithms. Such problems have given rise to breakthrough results and led to development of new techniques both within…
A rigidity theory is developed for the Euclidean and non-Euclidean placements of countably infinite simple graphs in R^d with respect to the classical l^p norms, for d>1 and 1<p<\infty. Generalisations are obtained for the Laman and…
The abundance of interconnected data has fueled the design and implementation of graph generators reproducing real-world linking properties, or gauging the effectiveness of graph algorithms, techniques and applications manipulating these…
The goal of the paper is to apply the general operator theoretic construction known as the Schur complement for computation of the spectrum of certain infinite graphs which can be viewed as finite graphs with the ray attached to them. The…