Publication

A Precise Threshold For Quasi-Ramsey Numbers

Related publications (158)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

A Windowed Graph Fourier Transform

Pierre Vandergheynst, Benjamin Ricaud, David Shuman

The prevalence of signals on weighted graphs is increasing; however, because of the irregular structure of weighted graphs, classical signal processing techniques cannot be directly applied to signals on graphs. In this paper, we define generalized transla ...

IEEE2012

Formation preserving path finding in 3-D terrains

Ali Galip Bayrak

Navigation of a group of autonomous agents that are required to maintain a formation is a challenging task which has not been studied much especially in 3-D terrains. This paper presents a novel approach to collision free path finding of multiple agents pr ...

Springer Verlag2012

Data mining for materials: Computational experiments with AB compounds

Wanda Andreoni

Machine learning is a broad discipline that comprises a variety of techniques for extracting meaningful information and patterns from data. It draws on knowledge and "know-how" from various scientific areas such as statistics, graph theory, linear algebra, ...

2012

On localisation and uncertainty measures on graphs

Nathanaël Perraudin

Due to the appearance of data on networks such as internet or Facebook, the number of applications of signal on weighted graph is increasing. Unfortunately, because of the irregular structure of this data, classical signal processing techniques are not app ...

2012

A result on flip-graph connectivity

Lionel Pournin

A polyhedral subdivision of a d-dimensional point configuration A is k-regular if it is projected from the boundary complex of a polytope with dimension at most d+k. Call γk(A) the subgraph induced by k-regular triangulations in the flip-graph of A. Gel’fa ...

Walter de Gruyter2012

Chebyshev polynomial approximation for transductive learning on graphs

Nathanaël Perraudin

The goal of transductive learning is to find a way to recover the labels of lots of data with only a few known samples. In this work, we will work on graphs for two reasons. First, it’s possible to construct a graph from a given dataset with features. The ...

2011

On the connectivity of visibility graphs

The visibility graph of a finite set of points in the plane has the points as vertices and an edge between two vertices if the line segment between them contains no other points. This paper establishes bounds on the edge- and vertex-connectivity of visibil ...

2011

Disjoint homometric sets in graphs

János Pach

Two subsets of vertices in a graph are called homometric if the multisets of distances determined by them are the same. Let h(n) denote the largest number h such that any connected graph of n vertices contains two disjoint homometric subsets of size h. It ...

2011

Minimum clique partition in unit disk graphs

János Pach

The minimum clique partition (MCP) problem is that of partitioning the vertex set of a given graph into a minimum number of cliques. Given n points in the plane, the corresponding unit disk graph (UDG) has these points as vertices, and edges connecting poi ...

Springer Verlag2011

Conway's conjecture for monotone thrackles

János Pach

A drawing of a graph in the plane is called a thrackle if every pair of edges meet precisely once, either at a common vertex or at a proper crossing. According to Conway's conjecture, every thrackle has at most as many edges as vertices. We prove this conj ...

Mathematical Association of America2011