Concept

Graphe complet

Publications associées (67)

Metastability of the Potts Ferromagnet on Random Regular Graphs

We study the performance of Markov chains for the q-state ferromagnetic Potts model on random regular graphs. While the cases of the grid and the complete graph are by now well-understood, the case of random regular graphs has resisted a detailed analysis ...

SPRINGER2023

AiiDA-defects: an automated and fully reproducible workflow for the complete characterization of defect chemistry in functional materials

Nicola Marzari, Sokseiha Muy, Conrad Johnston

Functional materials that enable many technological applications in our everyday lives owe their unique properties to defects that are carefully engineered and incorporated into these materials during processing. However, optimizing and characterizing thes ...

IOP Publishing Ltd2023

Superior visible light-mediated catalytic activity of a novel N-doped, Fe3O4-incorporating MgO nanosheet in presence of PMS: Imidacloprid degradation and implications on simultaneous bacterial inactivation

Stefanos Giannakis, Jérémie Decker

Impressive Imidacloprid (IMD) degradation and bacterial inactivation were attained through the photocatalytic activation of peroxymonosulfate (PMS) via a novel, N-doped MgO@Fe3O4, under visible light. After complete characterization (XPS, XRD, FT-IR, FE-SE ...

ELSEVIER2022

Fast Lead-Free Humidity Sensor Based on Hybrid Halide Perovskite

László Forró, Dragan Damjanovic, Endre Horvath, Alla Arakcheeva, Márton Kollár, Pavao Roko Andricevic, Trpimir Ivsic

An environmentally friendly analog of the prominent methylammonium lead halide perovskite, methylammonium bismuth bromide (MA3Bi2Br9), was prepared and investigated in the form of powder, single crystals and nanowires. Complete characterization via synchro ...

2022

Recoloring subgraphs of K-2n for sports scheduling

Dominique de Werra

The exploration of one-factorizations of complete graphs is the foundation of some classical sports scheduling problems. One has to traverse the landscape of such one-factorizations by moving from one of those to a so-called neighbor one-factorization. Thi ...

ELSEVIER2021

Plunging circular jets : Experimental characterization of dynamic pressures near the stagnation zone

Gregoire Aurelien Marie Jamet

Spillways are a requirement for dams' safety, mainly preventing dam over-topping in ood cases. A common spillway solution involves plunging jets which dissipate a considerable energy ow in the plunge pool. Dissipation has to occur in a controlled manner to ...

2021

Letter graphs and geometric grid classes of permutations: Characterization and recognition

Dominique de Werra

In this paper, we reveal an intriguing relationship between two seemingly unrelated notions: letter graphs and geometric grid classes of permutations. An important property common for both of them is well-quasi-orderability, implying, in a non-constructive ...

ELSEVIER2020

Simple Realizability of Complete Abstract Topological Graphs Simplified

Jan Kyncl

An abstract topological graph (briefly an AT-graph) is a pair A = (G, X) where G = (V, E) is a graph and X. E2 is a set of pairs of its edges. The AT-graph A is simply realizable if G can be drawn in the plane so that each pair of edges from X crosses exac ...

SPRINGER2020

Who Started This Rumor? Quantifying the Natural Differential Privacy of Gossip Protocols

Rachid Guerraoui, Hadrien Hendrikx

Gossip protocols (also called rumor spreading or epidemic protocols) are widely used to disseminate information in massive peer-to-peer networks. These protocols are often claimed to guarantee privacy because of the uncertainty they introduce on the node t ...

Schloss Dagstuhl, Leibniz-Zentrum2020

The Schur-Erdos problem for sesmi-algebraic colorings

János Pach

We considerm-colorings of the edges of a complete graph, where each color class is defined semi-algebraically with bounded complexity. The casem= 2 was first studied by Alon et al., who applied this framework to obtain surprisingly strong Ramsey-type resul ...

HEBREW UNIV MAGNES PRESS2020

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search