The partition function of the q-state Potts model with random ferromagnetic couplings in the large-q limit is generally dominated by the contribution of a single diagram of the high temperatureâ€¦ (More)

For integers m, k â‰¥ 1, we investigate the maximum size of a directed cut in directed graphs in which there are m edges and each vertex has either indegree at most k or outdegree at most k.

A path graph is the intersection graph of subpaths of a tree. In 1970, Renz asked for a characterization of path graphs by forbidden induced subgraphs. We answer this question by determining theâ€¦ (More)

Results of LovÃ¡sz and Padberg entail that the class of so-called partitionable graphs contains all the potential counterexamples to Bergeâ€™s famous Strong Perfect Graph Conjecture, which asserts thatâ€¦ (More)

A fasciagraph consists of a sequence of copies of the same graph, each copy being linked to the next one according to a regular scheme. More precisely, a fasciagraph is characterized by an integer nâ€¦ (More)

An identifying code in a graph G is a subset of vertices with the property that for each vertex v âˆˆ V (G), the collection of elements of C at distance at most 1 from v is non-empty and distinct fromâ€¦ (More)