Concept

Odd graph

Related publications (6)

Independence number of generalized Petersen graphs

Determining the size of a maximum independent set of a graph G, denoted by alpha(G), is an NP-hard problem. Therefore many attempts are made to find upper and lower bounds, or exact values of alpha(G) for special classes of graphs. This paper is aimed towa ...

Charles Babbage Res Ctr2016

Motivic invariants of moduli spaces of rank 2 Bradlow-Higgs triples

Riccardo Grandi

In the present thesis we study the geometry of the moduli spaces of Bradlow-Higgs triples on a smooth projective curve C. There is a family of stability conditions for triples that depends on a positive real parameter Ï. The moduli spaces of Ï-semistable ...

EPFL2016

Node-weighted network design and maximum sub-determinants

Carsten Moldenhauer

We consider the Node-weighted Steiner Forest problem on planar graphs. Demaine et al. showed that a generic primal-dual algorithm gives a 6-approximation. We present two different proofs of an approximation factor of~

3

. Then, we draw a connection to Goem ...

EPFL2014

Intersection Patterns of Edges in Topological Graphs

Radoslav Fulek

This thesis is devoted to crossing patterns of edges in topological graphs. We consider the following four problems: A thrackle is a graph drawn in the plane such that every pair of edges meet exactly once: either at a common endpoint or in a proper crossi ...

EPFL2012

The potential to improve the choice: list conflict-free coloring for geometric hypergraphs

Shakhar Smorodinsky

Given a geometric hypergraph (or a range-space)

H=(V,\cal E)

, a coloring of its vertices is said to be conflict-free if for every hyperedge

S \in \cal E

there is at least one vertex in

S

whose color is distinct from the colors of all other vertices i ...

2010

Explicit construction of self-dual integral normal bases for the square-root of the inverse different

Erik Jarl Pickett

Let K be a finite extension of Q(p), let L/K be a finite abelian Galois extension of odd degree and let D-L be the valuation ring of L. We define A(L/K) to be the unique fractional D-L-ideal with square equal to the inverse different of L/K. For p an odd p ...

2009

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.