Related papers: An Introduction to the Discharging Method
We complete the characterization of the digraphs $D$ for which the induced $D$-removal lemma has polynomial bounds, answering a question of Alon and Shapira. We also study the analogous problem for $k$-colored complete graphs. In…
Diagram chasing is a customary proof method used in category theory and homological algebra. It involves an element-theoretic approach to show that certain properties hold for a commutative diagram. When dealing with abelian categories for…
Recent progress in the construction of both electric, coloured and magnetic charges in gauge theories will be presented. The topological properties of the charged sectors will be highlighted as well as the applications of this work to…
There are several ways to generalize graph coloring to signed graphs. M\'a\v{c}ajov\'a, Raspaud and \v{S}koviera introduced one of them and conjectured that in this setting, for signed planar graphs four colors are always enough,…
A formal proof has not been found for the four color theorem since 1852 when Francis Guthrie first conjectured the four color theorem. Why? A bad idea, we think, directed people to a rough road. Using a similar method to that for the formal…
Graph theory provides fundamental concepts for many fields of science like statistical physics, network analysis and theoretical computer science. Here we give a pedagogical introduction to graph theory, divided into three sections. In the…
The topic of this treatise is a combinatorial technique called Graph Pebbling. We investigate pebbling numbers, weight functions, flow networks, hypercubes, and the zero-sum conjecture of Erd\H{o}s and Lemke. This investigation is a…
We prove that every digraph has a vertex 4-colouring such that for each vertex $v$, at most half the out-neighbours of $v$ receive the same colour as $v$. We then obtain several results related to the conjecture obtained by replacing 4 by…
We introduce a dynamic version of the graph coloring problem and prove its fixed-parameter tractability with respect to the edit-parameter. This is used to present a {\em turbo-charged} heuristic for the problem that works by combining the…
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…
The chapter aims to explore the application of graph theory and networks in the recommendation domain, encompassing the mathematical models that form the foundation for the algorithms and recommendation systems developed based on them. The…
This paper provides a survey of methods, results, and open problems on graph and hypergraph colourings, with a particular emphasis on semi-random `nibble' methods. We also give a detailed sketch of some aspects of the recent proof of the…
A continuum model to study the influence of dislocations on the electronic properties of condensed matter systems is described and analyzed. The model is based on a geometrical formalism that associates a density of dislocations with the…
We demonstrate the effectiveness of two techniques for using x-rays to evaluate the amount of charge diffusion in charge coupled devices (CCDs). We quantify the degree of charge diffusion with two parameters: sigma_d, the standard deviation…
Disentanglement via mechanism sparsity was introduced recently as a principled approach to extract latent factors without supervision when the causal graph relating them in time is sparse, and/or when actions are observed and affect them…
The differential equation method is applied to evaluate analytically two-loop vertex Feynman diagrams. Three on-shell infrared divergent planar two-loop diagrams with zero thresholds contributing to the processes Z --> bb bar (for zero b…
Coloring problems in graphs have been used to model a wide range of real applications. In particular, the List Coloring Problem generalizes the well-known Graph Coloring Problem for which many exact algorithms have been developed. In this…
Graphs are widely used as a popular representation of the network structure of connected data. Graph data can be found in a broad spectrum of application domains such as social systems, ecosystems, biological networks, knowledge graphs, and…
Many graph coloring proofs proceed by showing that a minimal counterexample to the theorem being proved cannot contain certain configurations, and then showing that each graph under consideration contains at least one such configuration;…
In this paper, we consider the problem of a star coloring. In general case the problems in NP-complete. We establish the star chromatic number for splitting graph of complete and complete bipartite graphs, as well of paths and cycles. Our…