A graphical partition of the even integer n is a partition of n where each part of the partition is the degree of a vertex in a simple graph and the degree sum of the graph is n. ...
Deborah A. Frank, Carla D. Savage, James A. Seller...
Abstract. Set agreement is a fundamental problem in distributed computing in which processes collectively choose a small subset of values from a larger set of proposals. The imposs...
Dan Alistarh, Seth Gilbert, Rachid Guerraoui, Core...
Tree decompositions of graphs are of fundamental importance in structural and algorithmic graph theory. Planar decompositions generalise tree decompositions by allowing an arbitrar...
We enumerate all totally real number fields F with root discriminant F 14. There are 1229 such fields, each with degree [F : Q] 9. In this article, we consider the following prob...
Erdos posed the problem of finding conditions on a graph G that imply t(G) = b(G), where t(G) is the largest number of edges in a triangle-free subgraph and b(G) is the largest nu...