Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userLogical limit laws for minor-closed classes of graphs
180
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
Let $mathcal G$ be an addable, minor-closed class of graphs. We prove that the zero-one law holds in monadic second-order logic (MSO) for the random graph drawn uniformly at random from all {em connected} graphs in $mathcal G$ on $n$ vertices, and the convergence law in MSO holds if we draw uniformly at random from all graphs in $mathcal G$ on $n$ vertices. We also prove analogues of these results for the class of graphs embeddable on a fixed surface, provided we restrict attention to first order logic (FO). Moreover, the limiting probability that a given FO sentence is satisfied is independent of the surface $S$. We also prove that the closure of the set of limiting probabilities is always the finite union of at least two disjoint intervals, and that it is the same for FO and MSO. For the classes of forests and planar graphs we are able to determine the closure of the set of limiting probabilities precisely. For planar graphs it consists of exactly 108 intervals, each of length $approx 5cdot 10^{-6}$. Finally, we analyse examples of non-addable classes where the behaviour is quite different. For instance, the zero-one law does not hold for the random caterpillar on $n$ vertices, even in FO.
rate research
Read More
Binary functions are a generalisation of the cocircuit spaces of binary matroids to arbitrary functions. Every rank function is assigned a binary function, and the deletion and contraction operations of binary functions generalise matroid deletion and contraction. We give the excluded minor characterisations for the classes of binary functions with well defined minors, and those with an associated rank function. Within these classes, we also characterise the classes of binary functions corresponding to polymatroids, matroids and binary matroids by their excluded minors. This gives a new proof of Tuttes excluded minor characterisation of binary matroids in the more generalised space of binary functions.
Stanislaw Ulam asked whether there exists a universal countable planar graph (that is, a countable planar graph that contains every countable planar graph as a subgraph). Janos Pach (1981) answered this question in the negative. We strengthen this result by showing that every countable graph that contains all countable planar graphs must contain (i) an infinite complete graph as a minor, and (ii) a subdivision of the complete graph $K_t$ with multiplicity $t$, for every finite $t$. On the other hand, we construct a countable graph that contains all countable planar graphs and has several key properties such as linear colouring numbers, linear expansion, and every finite $n$-vertex subgraph has a balanced separator of size $O(sqrt{n})$. The graph is $mathcal{T}_6boxtimes P_{!infty}$, where $mathcal{T}_k$ is the universal treewidth-$k$ countable graph (which we define explicitly), $P_{!infty}$ is the 1-way infinite path, and $boxtimes$ denotes the strong product. More generally, for every positive integer $t$ we construct a countable graph that contains every countable $K_t$-minor-free graph and has the above key properties. Our final contribution is a construction of a countable graph that contains every countable $K_t$-minor-free graph as an induced subgraph, has linear colouring numbers and linear expansion, and contains no subdivision of the countably infinite complete graph (implying (ii) above is best possible).
Kirchhoff-type Laws for signed graphs are characterized by generalizing transpedances through the incidence-oriented structure of bidirected graphs. The classical $2$-arborescence interpretation of Tutte is shown to be equivalent to single-element Boolean classes of reduced incidence-based cycle covers, called contributors. A generalized contributor-transpedance is introduced using entire Boolean classes that naturally cancel in a graph; classical conservation is proven to be property of the trivial Boolean classes. The contributor-transpedances on signed graphs are shown to produce non-conservative Kirchhoff-type Laws, where every contributor possesses the unique source-sink path property. Finally, the maximum value of a contributor-transpedance is calculated through the signless Laplacian.
For positive integers $n$ and $e$, let $kappa(n,e)$ be the minimum crossing number (the standard planar crossing number) taken over all graphs with $n$ vertices and at least $e$ edges. Pach, Spencer and Toth [Discrete and Computational Geometry 24 623--644, (2000)] showed that $kappa(n,e) n^2/e^3$ tends to a positive constant (called midrange crossing constant) as $nto infty$ and $n ll e ll n^2$, proving a conjecture of ErdH{o}s and Guy. In this note, we extend their proof to show that the midrange crossing constant exists for graph classes that satisfy a certain set of graph properties. As a corollary, we show that the the midrange crossing constant exists for the family of bipartite graphs. All these results have their analogues for rectilinear crossing numbers.
Given a countable set S of positive reals, we study finite-dimensional Ramsey-theoretic properties of the countable ultrametric Urysohn space with distances in S.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
