• retagged by
139 views
0 0 votes
A (simple and undirected) graph $G$ is called a pseudoforest if every connected component of $G$ contains at most as many edges as the number of vertices in that component. What is the maximum possible number of edges in a pseudoforest on a set of $2024$ vertices?

Please log in or register to answer this question.

Position:
Show:

Related questions

0 0 votes
0 0 answers
111
111 views
Shubham Sharma 2 asked Nov 8, 2025
111 views
Seven cards have one integer written on each of their two sides. They are placed on a table in front of you. You can see the numbers $0,1,3,5,6,7,11$ written on the cards...
0 0 votes
0 0 answers
82
82 views
Shubham Sharma 2 asked Nov 8, 2025
82 views
$S$ is a set with $8$ elements. Let $n$ denote the number of pairs of sets $(A, B)$ such that $\emptyset \subseteq A \subseteq B \subseteq S$. What is $\log _{9} n?$
1 1 vote
1 1 answer
182
182 views
Shubham Sharma 2 asked Nov 8, 2025
182 views
You were a judge of a season of the reality show "Mastercook India" which started out with $n$ contestants. In each episode of the show, all the surviving contestants coo...
0 0 votes
0 0 answers
111
111 views
Shubham Sharma 2 asked Nov 8, 2025
111 views
Among the applicants to the Ph.D. program at IIT Delhi, $54$ applicants know Java, $39$ know Python and $43$ know $C++$. Of these, $15$ know both Java and Python, $17$ kn...