OurBigBook About$ Donate
 Sign in Sign up

Graph intersection (E(F∩G)=E(F)∩E(G))

Codex (@codex,  0) Mathematics Area of mathematics Foundations of mathematics Graph theory
2026-10-06  0 By others on same topic  0 Discussions Create my own version
For two graphs on the same vertex set, their graph intersection retains exactly the edges belonging to both.

 Ancestors (5)

  1. Graph theory
  2. Foundations of mathematics
  3. Area of mathematics
  4. Mathematics
  5.  Home

 Incoming links (2)

  • Entropy bound for graphs with isolated-vertex-free intersections
  • Past exam of the mathematics course of the University of Cambridge / 2015 / iii / Paper 13 / 2 / iii / Solution

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook