Related papers: Blow-up trick in Combinatorics
Boolean combinations allow combining given combinatorial objects to obtain new, potentially more complicated, objects. In this paper, we initiate a systematic study of this idea applied to graphs. In order to understand expressive power and…
The family Blow Up formula is recalled. Certain combinatoric graphs are introduced for the discussion of the counting of nodal curves on an Kahler surface.
An influential theorem of Nikiforov states that if an $N$-vertex graph $G$ contains at least $\gamma N^h$ copies of some fixed $h$-vertex graph $H$, then $G$ contains an $H$-blowup of order $c_H(\gamma)\log N$. We provide a new proof of…
We define a two-player combinatorial game in which players take alternate turns; each turn consists on deleting a vertex of a graph, together with all the edges containing such vertex. If any vertex became isolated by a player's move then…
Graph burning is a deterministic, discrete-time process that models how influence or contagion spreads in a graph. Associated to each graph is its burning number, which is a parameter that quantifies how quickly the influence spreads. We…
A technique called graphical condensation is used to prove various combinatorial identities among numbers of (perfect) matchings of planar bipartite graphs and tilings of regions. Graphical condensation involves superimposing matchings of a…
Geometric singular perturbation theory provides a powerful mathematical framework for the analysis of 'stationary' multiple time-scale systems which possess a critical manifold, i.e. a smooth manifold of steady states for the limiting fast…
We introduce a concept of blown-up \v{C}ech cohomology for coherent sheaves of homological dimension $\leq 1$ and some quasi-coherent sheaves on a non-singular real affine variety. Its construction involves a directed set of multi-blowups.…
Numerous approaches study the vulnerability of networks against social contagion. Graph burning studies how fast a contagion, modeled as a set of fires, spreads in a graph. The burning process takes place in synchronous, discrete rounds. In…
In recent joint work (2021), we introduced a novel multivariate polynomial attached to every metric space - in particular, to every finite simple connected graph $G$ - and showed it has several attractive properties. First, it is…
We revisit the problem of counting the number of copies of a fixed graph in a random graph or multigraph, including the case of constrained degrees. Our approach relies heavily on analytic combinatorics and on the notion of patchwork to…
Graphings are special bounded-degree graphs on probability spaces, representing limits of graph sequences that are convergent in a local or local-global sense. We describe a procedure for turning the underlying space into a compact metric…
In a recent work, Allen, B\"{o}ttcher, H\`{a}n, Kohayakawa, and Person provided a first general analogue of the blow-up lemma applicable to sparse (pseudo)random graphs thus generalising the classic tool of Koml\'{o}s, S\'{a}rk\"{o}zy, and…
We study the blow-down map in cohomology in the context of real projective blowups of Lie algebroids. Using the blow-down map in cohomology we compute the Lie algebroid cohomology of the blowup of transversals of arbitrary codimension,…
We study the cutoff phenomenon for generalized riffle shuffles where, at each step, the deck of cards is cut into a random number of packs of multinomial sizes which are then riffled together.
Coalescing involves gluing one or more rooted graphs onto another graph. Under specific conditions, it is possible to start with cospectral graphs that are coalesced in similar ways that will result in new cospectral graphs. We present a…
The \emph{blow-up} of a graph $H$ is the graph obtained from replacing each edge in $H$ by a clique of the same size where the new vertices of the cliques are all different. Erd\H{o}s et al. and Chen et al. determined the extremal number of…
We propose a new family of combinatorial inference problems for graphical models. Unlike classical statistical inference where the main interest is point estimation or parameter testing, combinatorial inference aims at testing the global…
The graph reconstruction conjecture states that all graphs on at least three vertices are determined up to isomorphism by their deck. In this paper, a general framework for this problem is proposed to simply explain the reconstruction of…
The universal scheme of clusters of sections is an adaption of Kleiman's iterated blow ups (which parametrise clusters of points) to parametrise clusters of sections. They can also be constructed iteratively, but the iterative step is not…