mathworld.wolfram.com/PartialOrder.html

Preview meta tags from the mathworld.wolfram.com website.

Linked Hostnames

7

Thumbnail

Search Engine Appearance

Google

https://mathworld.wolfram.com/PartialOrder.html

Partial Order -- from Wolfram MathWorld

A relation "<=" is a partial order on a set S if it has: 1. Reflexivity: a<=a for all a in S. 2. Antisymmetry: a<=b and b<=a implies a=b. 3. Transitivity: a<=b and b<=c implies a<=c. For a partial order, the size of the longest chain (antichain) is called the partial order length (partial order width). A partially ordered set is also called a poset. A largest set of unrelated vertices in a partial order can be found using MaximumAntichain[g] in the Wolfram...



Bing

Partial Order -- from Wolfram MathWorld

https://mathworld.wolfram.com/PartialOrder.html

A relation "<=" is a partial order on a set S if it has: 1. Reflexivity: a<=a for all a in S. 2. Antisymmetry: a<=b and b<=a implies a=b. 3. Transitivity: a<=b and b<=c implies a<=c. For a partial order, the size of the longest chain (antichain) is called the partial order length (partial order width). A partially ordered set is also called a poset. A largest set of unrelated vertices in a partial order can be found using MaximumAntichain[g] in the Wolfram...



DuckDuckGo

https://mathworld.wolfram.com/PartialOrder.html

Partial Order -- from Wolfram MathWorld

A relation "<=" is a partial order on a set S if it has: 1. Reflexivity: a<=a for all a in S. 2. Antisymmetry: a<=b and b<=a implies a=b. 3. Transitivity: a<=b and b<=c implies a<=c. For a partial order, the size of the longest chain (antichain) is called the partial order length (partial order width). A partially ordered set is also called a poset. A largest set of unrelated vertices in a partial order can be found using MaximumAntichain[g] in the Wolfram...

  • General Meta Tags

    17
    • title
      Partial Order -- from Wolfram MathWorld
    • DC.Title
      Partial Order
    • DC.Creator
      Weisstein, Eric W.
    • DC.Description
      A relation "<=" is a partial order on a set S if it has: 1. Reflexivity: a<=a for all a in S. 2. Antisymmetry: a<=b and b<=a implies a=b. 3. Transitivity: a<=b and b<=c implies a<=c. For a partial order, the size of the longest chain (antichain) is called the partial order length (partial order width). A partially ordered set is also called a poset. A largest set of unrelated vertices in a partial order can be found using MaximumAntichain[g] in the Wolfram...
    • description
      A relation "<=" is a partial order on a set S if it has: 1. Reflexivity: a<=a for all a in S. 2. Antisymmetry: a<=b and b<=a implies a=b. 3. Transitivity: a<=b and b<=c implies a<=c. For a partial order, the size of the longest chain (antichain) is called the partial order length (partial order width). A partially ordered set is also called a poset. A largest set of unrelated vertices in a partial order can be found using MaximumAntichain[g] in the Wolfram...

  • Open Graph Meta Tags

    5
    • og:image
      https://mathworld.wolfram.com/images/socialmedia/share/ogimage_PartialOrder.png
    • og:url
      https://mathworld.wolfram.com/PartialOrder.html
    • og:type
      website
    • og:title
      Partial Order -- from Wolfram MathWorld
    • og:description
      A relation "<=" is a partial order on a set S if it has: 1. Reflexivity: a<=a for all a in S. 2. Antisymmetry: a<=b and b<=a implies a=b. 3. Transitivity: a<=b and b<=c implies a<=c. For a partial order, the size of the longest chain (antichain) is called the partial order length (partial order width). A partially ordered set is also called a poset. A largest set of unrelated vertices in a partial order can be found using MaximumAntichain[g] in the Wolfram...

  • Twitter Meta Tags

    5
    • twitter:card
      summary_large_image
    • twitter:site
      @WolframResearch
    • twitter:title
      Partial Order -- from Wolfram MathWorld
    • twitter:description
      A relation "<=" is a partial order on a set S if it has: 1. Reflexivity: a<=a for all a in S. 2. Antisymmetry: a<=b and b<=a implies a=b. 3. Transitivity: a<=b and b<=c implies a<=c. For a partial order, the size of the longest chain (antichain) is called the partial order length (partial order width). A partially ordered set is also called a poset. A largest set of unrelated vertices in a partial order can be found using MaximumAntichain[g] in the Wolfram...
    • twitter:image:src
      https://mathworld.wolfram.com/images/socialmedia/share/ogimage_PartialOrder.png

  • Link Tags

    4
    • canonical
      https://mathworld.wolfram.com/PartialOrder.html
    • preload
      //www.wolframcdn.com/fonts/source-sans-pro/1.0/global.css
    • stylesheet
      /css/styles.css
    • stylesheet
      /common/js/c2c/1.0/WolframC2CGui.css.en

Links

48