The Holt-Klee condition for oriented matroids

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.

In this thesis, an original database is constituted, described and exploited in a geohistorical perspective, containing the registration of the population at the local level for the fifteen censuses conducted in Albania between 1918 and 2011. The precision ...

We introduce the Turan problem for edge ordered graphs. We call a simple graph edge ordered, if its edges are linearly ordered. An isomorphism between edge ordered graphs must respect the edge order. A subgraph of an edge ordered graph is itself an edge or ...

This paper investigates entropic matroids, that is, matroids whose rank function is given as the Shannon entropy of random variables. In particular, we consider p-entropic matroids, for which the random variables each have support of cardinality p. We draw ...

2-level polytopes naturally appear in several areas of pure and applied mathematics, including combinatorial optimization, polyhedral combinatorics, communication complexity, and statistics. In this paper, we present a study of some 2-level polytopes arisi ...

We show that the Chow covectors of a linkage matching field define a bijection of lattice points and we demonstrate how one can recover the linkage matching field from this bijection. This resolves two open questions from Sturmfels & Zelevinsky (1993) on l ...

A sparsifier of a graph G (Bencztir and Karger; Spielman and Teng) is a sparse weighted subgraph (G) over tilde that approximately retains the same cut structure of G. For general graphs, non-trivial sparsification is possible only by using weighted graphs ...

Unusually high compressional (P) to shear (S) wave velocity ratios (V-p/V-s) were measured at different subduction zones and interpreted as fluid-pressurized regions. Because no laboratory data reported such high values in isotropic rocks, mineralogical or ...

Two subsets A,B of an n-element ground set X are said to be crossing, if none of the four sets AB, A\B, B\A and X(AB) are empty. It was conjectured by Karzanov and Lomonosov forty years ago that if a family F of subsets of X does not contain k pairwise cr ...

We present new techniques to analyze natural local search algorithms for several variants of the max-sum diversification problem which, in its most basic form, is as follows: given an n-point set X subset of R-d and an integer k, select k points in X so th ...

Knapsack problems give a simple framework for decision making. A classical example is the min-knapsack problem (MinKnap): choose a subset of items with minimum total cost, whose total profit is above a given threshold. While this model successfully general ...

The paper introduces and specifies a formalism that provides complete representations of dataflow process network (DPN) program executions, by means of directed acyclic graphs. Such graphs, also known as execution trace graphs (ETG), are composed of nodes ...

Extensive amenability is a property of group actions which has recently been used as a tool to prove amenability of groups. We study this property and prove that it is preserved under a very general construction of semidirect products. As an application, w ...

Network alignment is a method to align nodes that belong to the same entity from different networks. A well-known application of network alignment is to map user accounts from different social networks that belong to the same person. As network alignment h ...

The Holt-Klee condition for oriented matroids

Chat with Graph Search

Géohistoire de l'Albanie moderne. Une lecture des recensements de 1918 à 2011

Edge Ordered Turan Problems

Entropic Matroids and Their Representation

On 2-Level Polytopes Arising In Combinatorial Settings

Matching fields and lattice points of simplices

New Notions and Constructions of Sparsification for Graphs and Hypergraphs

Anomalous Vp/Vs ratios at seismic frequencies might evidence highly damaged rocks in subduction zones

On the Size of K-Cross-Free Families

An Improved Analysis of Local Search for Max-Sum Diversification

On approximation algorithms and polyhedral relaxations for knapsack problems, and clustered planarity testing

Execution Trace Graph of Dataflow Process Networks

Extensive amenability and an application to interval exchanges

A comparative study on network alignment techniques