Publications associées à Generalized Turan problems for disjoint copies of graphs

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.

Extension complexity of stable set polytopes of bipartite graphs

Yuri Faenza, Manuel Francesco Aprile

The extension complexity xc(P) of a polytope P is the minimum number of facets of a polytope that affinely projects to P. Let G be a bipartite graph with n vertices, m edges, and no isolated vertices. Let STAB(G) be the convex hull of the stable sets of G. ...

Springer2017

A semi-algebraic version of Zarankiewicz's problem

János Pach

A bipartite graph G is semi-algebraic in R-d if its vertices are represented by point sets P,Q subset of R-d and its edges are defined as pairs of points (p,q) epsilon P x Q that satisfy a Boolean combination of a fixed number of polynomial equations and i ...

European Mathematical Soc2017

Method and System for Fault Detection and Faulted Line Identification in Power Systems using Synchrophasors-Based Real-Time State Estimation

Mario Paolone, Paolo Romano, Marco Pignati, Lorenzo Zanni

A method for a faulted line identification in a power network, including, at a generic time-instant, solving a plurality of parallel phasor measurement units based real-time state estimators, the state estimators having among each other different and augme ...

2017

The Erdos-Hajnal conjecture for rainbow triangles

János Pach

We prove that every 3-coloring of the edges of the complete graph on n vertices without a rainbow triangle contains a set of order ohm(n(1/3) log(2) n) which uses at most two colors, and this bound is tight up to a constant factor. This verifies a conjectu ...

Academic Press Inc Elsevier Science2015

Clustered planarity testing revisited

Radoslav Fulek, Jan Kyncl, Igor Malinovic

The Hanani--Tutte theorem is a classical result proved for the first time in the 1930s that characterizes planar graphs as graphs that admit a drawing in the plane in which every pair of edges not sharing a vertex cross an even number of times. We generali ...

2015

Curve Graphs On Surfaces Of Infinite Type

Hugo Parlier, Ariadna Fossas Tenas

We define and study analogs of curve graphs for infinite type surfaces. Our definitions use the geometry of a fixed surface and vertices of our graphs are infinite multicurves which are bounded in both a geometric and a topological sense. We show that the ...

Suomalainen Tiedeakatemia2015

Non-Rigid Graph Registration using Active Testing Search

Pascal Fua, Raphael Sznitman, Jan Kybic, Miguel Amável Dos Santos Pinheiro

We present a new approach for matching sets of branching curvilinear structures that form graphs embedded in R2 or R3 and may be subject to deformations. Unlike earlier methods, ours does not rely on local appearance similarity nor does require a good init ...

Institute of Electrical and Electronics Engineers2015

Saturated simple and k-simple topological graphs

János Pach, Jan Kyncl

A simple topological graph G is a graph drawn in the plane so that any pair of edges have at most one point in common, which is either an endpoint or a proper crossing. G is called saturated if no further edge can be added without violating this condition. ...

Elsevier Science Bv2015

Generalized Turan problems for disjoint copies of graphs

Graph Chatbot

Chattez avec Graph Search

Extension complexity of stable set polytopes of bipartite graphs

A semi-algebraic version of Zarankiewicz's problem

Method and System for Fault Detection and Faulted Line Identification in Power Systems using Synchrophasors-Based Real-Time State Estimation

The Erdos-Hajnal conjecture for rainbow triangles

Clustered planarity testing revisited

Reconstruction of Images from Gabor Graphs with Applications in Facial Image Processing

Curve Graphs On Surfaces Of Infinite Type

Non-Rigid Graph Registration using Active Testing Search

Saturated simple and k-simple topological graphs

Empty Triangles in Complete Topological Graphs

Reconstruction of Images from Gabor Graphs with Applications in Facial Image Processing

Extension complexity of stable set polytopes of bipartite graphs

Clustered planarity testing revisited

Saturated simple and k-simple topological graphs

Curve Graphs On Surfaces Of Infinite Type

Non-Rigid Graph Registration using Active Testing Search

A semi-algebraic version of Zarankiewicz's problem

Method and System for Fault Detection and Faulted Line Identification in Power Systems using Synchrophasors-Based Real-Time State Estimation

The Erdos-Hajnal conjecture for rainbow triangles

Empty Triangles in Complete Topological Graphs