Definitions
Nearby Words

# Incidence structure

In combinatorial mathematics, an incidence structure is a triple

$C=\left(P,L,I\right).,$

where P is a set of "points", L is a set of "lines" and $I subseteq P times L$ is the incidence relation. The elements of I are called flags. If

$\left(p,ell\right) in I,$

we say that point p "lies on" line ℓ.

## Comparison with other structures

A figure may look like a graph, but in a graph an edge has just two ends (beyond a vertex a new edge starts), while a line in an incidence structure can be incident to more points.

An incidence structure has no concept of a point being in between two other points, the order of points on a line is undefined.

## Dual structure

If we interchange the role of "points" and "lines" in

$C=\left(P,L,I\right),,!$

the dual structure

$C^*=\left(L,P,I^*\right),!$

is obtained, where I* is the inverse relation of I. Clearly

$C^\left\{**\right\}=C.,!$

A structure C that is isomorphic to its dual C* is called self-dual.

## Correspondence with hypergraphs

Each hypergraph or set system can be regarded as an incidence structure in which the universal set plays the role of "points", the corresponding family of sets plays the role of "lines" and the incidence relation is set membership "∈". Conversely, every incidence structure can be viewed as a hypergraph.

### Example: Fano plane

In particular, let

P = {1,2,3,4,5,6,7},

L = {{1,2,4},{2,3,5},{3,4,6},{4,5,7},{5,6,1},{6,7,2},{7,1,3}}

The corresponding incidence structure is called the Fano plane.

## Geometric representation

Incidence structures can be modelled by points and curves in the Euclidean plane with usual geometric incidence. Some incidence structures admit representation by points and lines. The Fano plane is not one of them since it needs at least one curve.

## Levi graph of an incidence structure

Each incidence structure $C$ corresponds to a bipartite graph called Levi graph or incidence graph with a given black and white vertex coloring where black vertices correspond to points and white vertices correspond to lines of $C$ and the edges correspond to flags.

### Example: Heawood graph

For instance, the Levi graph of the Fano plane is the Heawood graph. Since the Heawood graph is connected and vertex-transitive, there exists an automorphism (such as the one defined by a reflection about the vertical axis in the above figure) interchanging black and white vertices. This, in turn, implies that the Fano plane is self-dual.
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 8, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.920954167842865, "perplexity_flag": "head"}