Register

narsingh deo

755 views
0 votes
0 votes
In a village there are equal  no of boys and girls of marriageable age.Each boy dates a certain no. of girls and each girl dates a  certain number of boys,under what condition is it possible that every girl and boy  gets married to one of their dates?
User Avatar

1 Answer

0 votes
0 votes
Assume there are n boys and n girls, each boy and girl is dating k persons so ans is (k/n)^n
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
1
Manu Madhavan asked Nov 15, 2016
313 views
Doubt Perfext Matching
Finda a graph with every vertex degree at least 2, and have only one perfext matching. (In Perfect matching all vertex are matched.)
Finda a graph with every vertex degree at least 2, and have only one perfext matching. (In Perfect matching all vertex are matched.)
User Avatar
0 votes
0 votes
0 answers
2
Winner asked Mar 4, 2019
771 views
Narsingh deo
What is meant by edge disjoint hamiltonian circuits in a graph
What is meant by edge disjoint hamiltonian circuits in a graph
User Avatar
0 votes
0 votes
0 answers
3
Ayush Upadhyaya asked Jun 8, 2018
496 views
[4-14]Connectivity- Narsingh Deo
Show that a simple graph is nonseparable iff for any two given arbitrary edges a circuit can always be found that will include these two edges.
Show that a simple graph is nonseparable iff for any two given arbitrary edges a circuit can always be found that will include these two edges.
User Avatar
0 votes
0 votes
0 answers
4
Ayush Upadhyaya asked Jun 8, 2018
457 views
[4-13]Connectivity-Narsingh Deo
Show that a graph G is non-separable iff every vertex pair can be placed in some circuit in G.
Show that a graph G is non-separable iff every vertex pair can be placed in some circuit in G.
User Avatar
Link Copied!