Search
Search Results
-
Graph Classes with Locally Irregular Chromatic Index at most 4
A graph G is said to be locally irregular if each pair of adjacent vertices have different degrees in G . A collection of edge disjoint subgraphs
... 
-
Deterministic Coloring of a Family of Complexes
In the famous works “Tilings, substitution systems and dynamical systems generated by them” by S. Mozes and “Matching rules and substitution tilings”...
-
New bounds for locally irregular chromatic index of bipartite and subcubic graphs
A graph is locally irregular if the neighbors of every vertex v have degrees distinct from the degree of v . A locally irregular edge-coloring of a...
-
Induced arithmetic removal: complexity 1 patterns over finite fields
We prove an arithmetic analog of the induced graph removal lemma for complexity 1 patterns over finite fields. Informally speaking, we show that...
-
The 1-2-3 Conjecture Holds for Graphs with Large Enough Minimum Degree
Is there a universal constant K , say K = 3, such that one may dispose of all pairs of adjacent vertices with equal degrees from any given connected...
-
Geometry on Surfaces, a Source for Mathematical Developments
We present a variety of geometrical and combinatorial tools that are used in the study of geometric structures on surfaces: volume, contact,...
-
List of Publications for László Lovász
[1] On graphs not containing independent circuits. Mat. Lapok, 16:289–299 (in Hungarian).
-
Domain Decomposition for Non-smooth (in Particular TV) Minimization
Domain decomposition is one of the most efficient techniques to derive efficient methods for large-scale problems. In this chapter such decomposition...
-
A variety of filling patterns
A planar tiling is a gap- and overlap-less coverage of a plane with specially formed panels or tiles. The simplest forms are triangles and...
-
Compact graphings
Graphings are special bounded-degree graphs on probability spaces, representing limits of graph sequences that are convergent in a local...
-
Regular partitions of gentle graphs
Szemerédi's Regularity Lemma is a very useful tool of extremal combinatorics. Recently, several refinements of this seminal result were obtained for...
-
Geometric and Aesthetic Concepts Based on Pentagonal Structures
The relationship between geometry and art will be examined using the example of pentagonal structures. The work of contemporary Dutch artist Gerard...
-
Small Coarse Spaces for Overlap** Schwarz Algorithms with Irregular Subdomains
Methods are developed for automatically constructing small coarse spaces of low dimension for domain decomposition algorithms for problems in three...
-
Domain Decomposition for Non-smooth (in Particular TV) Minimization
Domain decomposition is one of the most efficient techniques to derive efficient methods for large-scale problems. In this chapter such decomposition...
-
Geometric and Aesthetic Concepts Based on Pentagonal Structures
The relationship between geometry and art will be examined using the example of pentagonal structures. The work of contemporary Dutch artist Gerard...
-
Geometric and Aesthetic Concepts Based on Pentagonal Structures
The relationship between geometry and art will be examined using the example of pentagonal structures. The work of contemporary Dutch artist Gerard...
-
An Annotated Glossary of Graph Theory Parameters, with Conjectures
This glossary contains an annotated listing of some 300 parameters of graphs, together with their definitions, and, for most of these, a reference to...
-
Crystallization in Two Dimensions and a Discrete Gauss–Bonnet Theorem
We show that the emerging field of discrete differential geometry can be usefully brought to bear on crystallization problems. In particular, we give...
-
Martin Kneser’s Publications
Comment. This article is reproduced here from Kneser’s personal preprint copy, which had, on it’s front page, the handwritten note, signed ‘MK’:
-
Capitalizing on live variables: new algorithms for efficient Hessian computation via automatic differentiation
We revisit an algorithm [called Edge Pushing (EP)] for computing Hessians using Automatic Differentiation (AD) recently proposed by Gower and Mello...
