Concept

Forbidden graph characterization

Publications associées (71)

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

Triangle-free intersection graphs of line segments with large chromatic number

Bartosz Maria Walczak, Michal Lason

In the 1970s Erdos asked whether the chromatic number of intersection graphs of line segments in the plane is bounded by a function of their clique number. We show the answer is no. Specifically, for each positive integer k we construct a triangle-free fam ...

Academic Press Inc Elsevier Science2014

Tangles and Degenerate Tangles

Andres Jacinto Ruiz Vargas

We study some variants of Conway’s thrackle conjecture. A tangle is a graph drawn in the plane such that its edges are represented by continuous arcs, and any two edges share precisely one point, which is either a common endpoint or an interior point at wh ...

Springer Berlin Heidelberg2013

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

Graph Drawing

Radoslav Fulek, Fabrizio Frati

In this paper we study the page number of upward planar directed acyclic graphs. We prove that the page number of any upward planar directed acyclic graph G is a function of the page number of a four-connected subgraph of G; further, we provide an upper bo ...

Springer Berlin Heidelberg2012

Lifting simplicial complexes to the boundary of convex polytopes

Lionel Pournin

Abstract: A simplicial complex C on a d-dimensional configuration of n points is k-regular if its faces are projected from the boundary complex of a polytope with dimension at most d+k. Since C is obviously (n-d-1)-regular, the set of all integers k for wh ...

Elsevier2012

Multi-terminal Secrecy in a Linear Non-coherent Packetized Networks

Christina Fragouli, Mahdi Jafari Siavoshani

We consider a group of m+1 trusted nodes that aim to create a shared secret key K over a network in the presence of a passive eavesdropper, Eve. We assume a linear non-coherent network coding broadcast channel (over a finite field F_q ) from one of the hon ...

2012

Multi-terminal Secrecy in a Linear Non-coherent Packetized Networks

Christina Fragouli, Mahdi Jafari Siavoshani

2012

A note on chromatic properties of threshold graphs

Dominique de Werra, Bernard Ries, Rico Zenklusen

In threshold graphs one may find weights for the vertices and a threshold value t such that for any subset S of vertices, the sum of the weights is at most the threshold t if and only if the set S is a stable (independent) set. In this note we ask a simila ...

2012

A separator theorem for string graphs and its applications

János Pach

A string graph is the intersection graph of a collection of continuous arcs in the plane. We show that any string graph with in edges can be separated into two parts of roughly equal size by the removal of O(m(3/4)root log m) vertices. This result is then ...

Cambridge University Press2010

Recursive analysis of singular ordinary differential equations

We investigate systems of ordinary differential equations with a parameter. We show that under suitable assumptions on the systems the solutions are computable in the sense of recursive analysis. As an application we give a complete characterization of the ...

Elsevier2010