Related papers: Blow-up trick in Combinatorics
A pebbling move on a graph removes two pebbles at a vertex and adds one pebble at an adjacent vertex. Rubbling is a version of pebbling where an additional move is allowed. In this new move one pebble is removed at vertices v and w adjacent…
The purposes of this article are threefold. First, to determine numerically when an arbitrary blowup of a smooth surface is smooth. We show the surface is smooth if and only if certain rational parameters involving log discrepancy and…
We refine the iterated blow-up techniques. This technique, combined with a rigidity result and a specific choice of the kernel projection in the Poincar\'e inequality, might be employed to completely linearize blow-ups along at least one…
Bottom-up layout algorithms for compound graphs are suitable for presenting the microscale view of models and are often used in model-driven engineering. However, they have difficulties at the macroscale where maintaining the overview of…
We continue the study of blow-ups in generalized complex geometry with the blow-up theory for generalized K\"ahler manifolds. The natural candidates for submanifolds to be blown-up are those which are generalized Poisson for one of the two…
Path-addition is an operation that takes a graph and adds an internally vertex-disjoint path between two vertices together with a set of supplementary edges. Path-additions are just the opposite of taking minors. We show that some classes…
We develop a new method for constructing approximate decompositions of dense graphs into sparse graphs and apply it to longstanding decomposition problems. For instance, our results imply the following. Let $G$ be a quasi-random $n$-vertex…
The recently introduced Theory of the Adjacent Possible (TAP) is a model of combinatorial innovation aiming to explain the "hockey-stick" upward trend of human technological evolution, where an explosion in the number of produced items with…
We study the problem of resolving singularities via the blow-up of the module of derivations. Our main results are a positive answer for the case of curves and log-canonical surface singularities, i.e., a finite sequence of blow-ups along…
An alternative foundation for 2-categories is explored by studying graph-theoretically a partial operation on 2-cells named juncture, which can replace vertical and horizontal composition. Juncture is a generalized vertical composition of…
In this paper we develop a blow up theory for the parabolic-elliptic Keller-Segel system, which can be viewed as a parabolic counterpart to the Liouville equation. This theory is applied to the study of first time singularities, ancient…
Graph aggregation is the process of computing a single output graph that constitutes a good compromise between several input graphs, each provided by a different source. One needs to perform graph aggregation in a wide variety of…
For any configuration of pebbles on the nodes of a graph, a pebbling move replaces two pebbles on one node by one pebble on an adjacent node. A cover pebbling is a move sequence ending with no empty nodes. The number of pebbles needed for a…
We investigate existence of global in time solutions and blow-up of solutions to the semilinear heat equation posed on infinite graphs. The source term is a general function $f(u)$. We always assume that the infimum of the spectrum of the…
We produce several algebraic curves, some well--known, some new, out of circles, by means of two classical (mutually reciprocal) algebraic methods: blow--down and blow--up.
A subgraph of an edge-coloured graph is called rainbow if all its edges have different colours. We prove a rainbow version of the blow-up lemma of Koml\'os, S\'ark\"ozy and Szemer\'edi that applies to almost optimally bounded colourings. A…
Given a graph $G$, a vertex switch of $v \in V(G)$ results in a new graph where neighbors of $v$ become nonneighbors and vice versa. This operation gives rise to an equivalence relation over the set of labeled digraphs on $n$ vertices. The…
A clustering algorithm partitions a set of data points into smaller sets (clusters) such that each subset is more tightly packed than the whole. Many approaches to clustering translate the vector data into a graph with edges reflecting a…
Clustering is a common technique for statistical data analysis, Clustering is the process of grouping the data into classes or clusters so that objects within a cluster have high similarity in comparison to one another, but are very…
A graph puzzle ${\rm Puz}(G)$ of a graph $G$ is defined as follows. A configuration of ${\rm Puz}(G)$ is a bijection from the set of vertices of a board graph to the set of vertices of a pebble graph, both graphs being isomorphic to some…