Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Add answer to 8.25 as well as some formatting and a gitignore. #1

Open
wants to merge 2 commits into
base: master
Choose a base branch
from

Conversation

natesholland
Copy link

I had to add some extra stuff to get this to compile.
But I have checked this and I know that all the latex is valid.
See https://proofwiki.org/wiki/Graph_is_Bipartite_iff_No_Odd_Cycles for more
information.

I also added a gitignore to ignore the pdf and log and other artifacts of
compiling .tex files.

@ryandougherty
Copy link
Owner

This does not conform to the style of other exercises, and the main .tex file is the one that is used to generate the pdf.

@ryandougherty
Copy link
Owner

And plus this solution to 8.25 only covers the first half of the question.

@natesholland
Copy link
Author

Ok I fixed the formatting and added a note about being partially complete, then squashed it down into one commit. I can come back later when I have time and sketch out the other direction of the proof.

@natesholland
Copy link
Author

As I typed up the question I realized that this also asks us to prove that bipartite is also in NL. To be completely honest I don't quite know how to do that. I have a good sketch in my head of how to show that no odd graphs implies bipartite but I'm really weak on proofs about space complexity.

See https://proofwiki.org/wiki/Graph_is_Bipartite_iff_No_Odd_Cycles for more
information.

I also added a gitignore to ignore the pdf and log and other artifacts of
compiling .tex files.
This caught me up for a bit so I added instructions to the README.
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

2 participants