Stack Exchange Network

Stack Exchange network consists of 180 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.

Visit Stack Exchange
Loading…
    • Tour Start here for a quick overview of the site
    • Help Center Detailed answers to any questions you might have
    • Meta Discuss the workings and policies of this site
    • About Us Learn more about Stack Overflow the company
    • Business Learn more about our products
  1. current community

    • Mathematics
      help chat
    • Mathematics Meta

    your communities

    Sign up or log in to customize your list.

    more stack exchange communities

    company blog
  2. Log in
  3. Sign up
Mathematics
  1. Home
    1. Public
    2. Questions
    3. Tags
    4. Users
    5. Unanswered
    1. Teams
      Stack Overflow for Teams – Start collaborating and sharing organizational knowledge. Create a free Team Why Teams?
    2. Teams
    3. Create free Team

Teams

Q&A for work

Connect and share knowledge within a single location that is structured and easy to search.

Learn more
user avatar
user avatar
user avatar
pasha
  • Member for 3 years, 1 month
  • Last seen more than a month ago
  • Mumbai
  • Meta user
  • Network profile
Profile Activity
  • Summary
  • Answers
  • Questions
  • Tags
  • Badges
  • Bookmarks
  • Bounties
  • Reputation
  • All actions

5 Answers

Score Activity Newest
1 vote

Why is "If every proper subgraph of G is bipartite, then G is bipartite." False

graph-theory bipartite-graphs
answered Nov 27, 2020 at 20:10
0 votes
Accepted

Find the coordinates of the vector $\vec x =[5,0]$ relative to the basis $B$

linear-algebra coordinate-systems change-of-basis
answered Mar 9, 2020 at 2:59
0 votes
Accepted

Probability that 2 identical binomial experiments are within an interval of each other

probability probability-distributions binomial-distribution
answered Apr 1, 2020 at 17:52
0 votes

Another angle inside a pentagon

geometry euclidean-geometry plane-geometry polygons
answered Apr 16, 2020 at 3:35
0 votes
Accepted

Let $G$ be a connected graph. Prove that if $E(G)$ is greater than or equal to $V(G)$ then $G$ contains at least three edges that are not bridges.

graph-theory graph-connectivity
answered Sep 30, 2020 at 11:33
Mathematics
  • Tour
  • Help
  • Chat
  • Contact
  • Feedback
Company
  • Stack Overflow
  • Teams
  • Advertising
  • Collectives
  • Talent
  • About
  • Press
  • Legal
  • Privacy Policy
  • Terms of Service
  • Cookie Settings
  • Cookie Policy
Stack Exchange Network
  • Technology
  • Culture & recreation
  • Life & arts
  • Science
  • Professional
  • Business
  • API
  • Data
  • Blog
  • Facebook
  • Twitter
  • LinkedIn
  • Instagram

Site design / logo © 2022 Stack Exchange Inc; user contributions licensed under cc by-sa. rev 2022.6.28.42464

Your privacy

By clicking “Accept all cookies”, you agree Stack Exchange can store cookies on your device and disclose information in accordance with our Cookie Policy.