@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:-DMPWC14W-J .

psr: a skos:ConceptScheme .
psr:-DMPWC14W-J
  skos:definition """In mathematics, a combination is a selection of items from a set that has distinct members, such that the order of selection does not matter (unlike permutations). For example, given three fruits, say an apple, an orange and a pear, there are three combinations of two that can be drawn from this set: an apple and a pear; an apple and an orange; or a pear and an orange. More formally, a <i>k</i>-combination of a set <i>S</i> is a subset of <i>k</i> distinct elements of <i>S</i>. So, two combinations are identical if and only if each combination has the same members. 
<br/>(Wikipedia, The Free Encyclopedia, <a href="https://en.wikipedia.org/wiki/Combination">https://en.wikipedia.org/wiki/Combination</a>)"""@en ;
  a skos:Concept ;
  skos:inScheme psr: ;
  skos:broader psr:-B373Q2P1-V ;
  skos:prefLabel "combination"@en, "combinaison"@fr ;
  skos:exactMatch <https://en.wikipedia.org/wiki/Combination> .