Unacdemy graphs doubt

[Somasree (Somasree Majumder)]

What is the maximum number of edges possible in a simple graph with n vertices such that there is no circuit of even length?

A circuit is a sequence of vertices (possibly containing a vertex more than once) such that every adjacent pair of vertices in the sequence is directly connected by an edge in the graph and no edge occurs twice.

Pls help me in thsi question

[aman212yadav (Aman Yadav)]

hello @Somasree

@Somasree

What is the maximum number of edges possible in a simple graph with n vertices such that there is no circuit of even length?

A circuit is a sequence of vertices (possibly containing a vertex more than once) such that every adjacent pair of vertices in the sequence is directly connected by an edge in the graph and no edge occurs twice.

is the given answer is nc2 - floor of (n*n/4)

[Somasree (Somasree Majumder)]

[aman212yadav (Aman Yadav)]

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.