@prefix psr: <http://data.loterre.fr/ark:/67375/PSR> .
@prefix skos: <http://www.w3.org/2004/02/skos/core#> .

psr:-B373Q2P1-V
  skos:prefLabel "combinatorics"@en, "combinatoire"@fr ;
  a skos:Concept ;
  skos:narrower psr:-RXJBMDT3-R .

psr: a skos:ConceptScheme .
psr:-RXJBMDT3-R
  skos:definition """In combinatorial mathematics, a Levi graph or incidence graph is a bipartite graph associated with an incidence structure. From a collection of points and lines in an incidence geometry or a projective configuration, we form a graph with one vertex per point, one vertex per line, and an edge for every incidence between a point and a line. They are named for Friedrich Wilhelm Levi, who wrote about them in 1942. 
<br/>(Wikipedia, The Free Encyclopedia, <a href="https://en.wikipedia.org/wiki/Levi_graph">https://en.wikipedia.org/wiki/Levi_graph</a>)"""@en, """En mathématiques, et plus particulièrement en combinatoire, un graphe de Levi ou graphe d'incidence est un graphe biparti associé à une structure d'incidence. 
<br/>(Wikipedia, L'Encylopédie Libre, <a href="https://fr.wikipedia.org/wiki/Graphe_de_Levi">https://fr.wikipedia.org/wiki/Graphe_de_Levi</a>)"""@fr ;
  skos:prefLabel "Levi graph"@en, "graphe de Levi"@fr ;
  skos:broader psr:-B373Q2P1-V ;
  skos:altLabel "incidence graph"@en, "graphe d'incidence"@fr ;
  skos:inScheme psr: ;
  a skos:Concept ;
  skos:exactMatch <https://en.wikipedia.org/wiki/Levi_graph>, <https://fr.wikipedia.org/wiki/Graphe_de_Levi> .