find all subgraphs

[remote heart]

So basically I have this graph right what are all the subgraphs? This is what I have so far:

Is this even right? 😖

<@&286206848099549185>

@dreamy sigil

I feel like there's too many cases to consider

Or is what I'm doing wrong?

HELPPPPPPPPPPPPPP

Kindly.

[remote heart]

<@&286206848099549185>

[dreamy sigil]

I have been pinged?
What is the definition of a subgraph that you are using?

I presume you are using the first definition here.
https://mathworld.wolfram.com/Subgraph.html

[remote heart]

All vertices of graph are in original graph and each edge in graph has same end vertices in original graph

idk lol

[remote heart]

yeah this looks right

[dreamy sigil]

So, you have 6 vertices. A subgraph will have a subset of these vertices. So 2^6=64 possible subsets of vertices.

[remote heart]

that makes me wonder if the question is asking something different or if it actually wants me to list all 64

it just says find all the subgraphs of the graph

[dreamy sigil]

There is going to be more than 64. 5 edges so at most 2^5=32 possible subsets of edges for each subset of vertices. So up to 2048 subgraphs. I'm writing code to compute the true amount.

[dreamy sigil]

One possibility is subgraps up to isomorphism. So only include a graph if it is essentially unique.

[dreamy sigil]

This page has 21 sub graphs, but only 4 up to isomorphism.

[dreamy sigil]

Wrote some code and found out there are 256 subgraphs.

[remote heart]

okay then it's definitely asking for something else

probably isomorphisms like u said