I have learnt that in a bipartite graph, we can partition vertices into 2 sets $V_1$ and $V_2$, and $E \subseteq V_1 \times V_2$. However, the cartesian product is a set of tuples, and edges (in an undirected graph) are sets. So how can $E$ be a subset of this Cartesian product when a set is a different mathematical object than a tuple, so none of its elements are equal to any of the elements in the Cartesian product?
2026-03-29 06:33:51.1774766031
How can we use a cartesian product in the definition for bipartite graph when its elements are tuples and edges can be sets?
41 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in DISCRETE-MATHEMATICS
- What is (mathematically) minimal computer architecture to run any software
- What's $P(A_1\cap A_2\cap A_3\cap A_4) $?
- The function $f(x)=$ ${b^mx^m}\over(1-bx)^{m+1}$ is a generating function of the sequence $\{a_n\}$. Find the coefficient of $x^n$
- Given is $2$ dimensional random variable $(X,Y)$ with table. Determine the correlation between $X$ and $Y$
- Given a function, prove that it's injective
- Surjective function proof
- How to find image of a function
- Find the truth value of... empty set?
- Solving discrete recursion equations with min in the equation
- Determine the marginal distributions of $(T_1, T_2)$
Related Questions in ELEMENTARY-SET-THEORY
- how is my proof on equinumerous sets
- Composition of functions - properties
- Existence of a denumerble partition.
- Why is surjectivity defined using $\exists$ rather than $\exists !$
- Show that $\omega^2+1$ is a prime number.
- A Convention of Set Builder Notation
- I cannot understand that $\mathfrak{O} := \{\{\}, \{1\}, \{1, 2\}, \{3\}, \{1, 3\}, \{1, 2, 3\}\}$ is a topology on the set $\{1, 2, 3\}$.
- Problem with Cartesian product and dimension for beginners
- Proof that a pair is injective and surjective
- Value of infinite product
Related Questions in GRAPH-THEORY
- characterisation of $2$-connected graphs with no even cycles
- Explanation for the static degree sort algorithm of Deo et al.
- A certain partition of 28
- decomposing a graph in connected components
- Is it true that if a graph is bipartite iff it is class 1 (edge-coloring)?
- Fake induction, can't find flaw, every graph with zero edges is connected
- Triangle-free graph where every pair of nonadjacent vertices has exactly two common neighbors
- Inequality on degrees implies perfect matching
- Proving that no two teams in a tournament win same number of games
- Proving that we can divide a graph to two graphs which induced subgraph is connected on vertices of each one
Related Questions in BIPARTITE-GRAPHS
- Is it true that if a graph is bipartite iff it is class 1 (edge-coloring)?
- Perfect Matching
- Complete bipartite planar graphs
- Is the graph described below bipartite?
- Prove that an even order ($n=2k$) graph without cycle of order 3, has a size $m \le k^2$
- min cost flow in offline bipartite graph problem
- Rearrangeable matrix visualization
- Is there a name for Chain of complete bipartite graphs?
- Determine if G is bipartite. Find a maximal path and Eulerian circuit in G.
- Does this graph have a Hamiltonian cycle?
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
Core misconception is this :
" ... edges (in a directed graph) are sets ... "
Edges are not really sets ( though we might have some way to achieve that , that is not the concern here )
Edges are ... Edges !
All of those Edges are in some Set , though the Edges themselves are not Sets.
This is true :
" ... a set is a different mathematical object than a tuple ... "
though it is not going to impact the Case that Edges are not Sets.
Illustrative Example :
We have a Bi-Partite graph.
Nodes are in a Set $V=\{v_0,v_1,v_2,v_3,v_4,v_5,v_6,v_7\}$.
Here , neither $v_0$ nor $v_7$ is a Set. These are Nodes , nothing more , nothing less.
Edges are $E=\{ E_1 , E_2 , E_3 , \cdots \}$.
We can see the the Edges can be given in terms of the Nodes , like this :
$E=\{(v_0,v_4),(v_0,v_5),(v_1,v_4), \cdots \}$.
Here , too , neither $(v_0,v_4)$ nor $(v_3,v_5)$ is a Set. These are Edges , nothing more , nothing less.
We use "Names" ( like $E_1$ ) or "Constituents" ( like $(v_0,v_1)$ ) to refer to those Edges.
In "Constituents" notation , we can see that the tuples are all in $V_1 \times V_2$ where $V_1$ & $V_2$ are the Partitions & all "Directions" are from $V_1$ to $V_2$. In other words , $E \subseteq V_1 \times V_2$.
ADDENDUM :
Query is about Directed graphs.
In Case it is not Directed graph , either [[A]] we have to first fix the order of writing the tuples ( ordered Pairs , where $E_1=(v_1,v_4)$ ) in the Cartesian Product or [[B]] we have to change the Cartesian Product to something else to generate something else ( unordered Pairs , where $E_1=(v_1,v_4)=(v_4,v_1)$ ) to handle the 2 orders.