MathOverflow will be down for maintenance for approximately 3 hours, starting Monday evening (06/24/2013) at approximately 9:00 PM Eastern time (UTC-4).

Zahra

179
Reputation
437 views
Is this your account?

Registered User 

Name Zahra
Member for 1 year
Seen May 3 at 18:28
Website
Location I.R.I
Age 24
I will write something later...
4

Questions
votes newest views recent
2
5
votes
1
answer
291
views

request sources about self-dual cyclic codes

jan 28 12 at 11:17 Zahra 179●1●1●7

2

 
1
vote
1
answer
621
views

The generator polynomial of cyclic code

dec 16 11 at 23:25 Shahrooz 972●1●2●13

 
0
votes
1
answer
209
views

Covering radius of LDPC codes

dec 13 11 at 18:48 Shahrooz 972●1●2●13

 

2

Answers
2
how to proof “every loopless graph G has a bipartite subgraph with at least e(G)/2 edges”?
2
For two graphs, $H$ and $G$ let $\bar{H}$ and $\bar{G}$ be their respective compliments. Then if $H$ is a subgraph of $G$, then $\bar{H}$ is a subgraph of $\bar{G}$.

 

36

Votes
34
2

 

7

Tags
× 3
× 2
× 2




 

9

Badges
● Fanatic
● Critic
 ● Teacher
● Autobiographer
 ● Enthusiast
● Supporter
 ● Editor
● Student
 ● Scholar