Theoretical Computer Science
Meta user
Network profile
512
reputation
4
17

Cyriac Antony

Currently doing PhD in graph theory in IIITDM Kancheepuram, India. I am working on graph colouring to be precise. I like mathematical and logical puzzles and games. Interested in combinatorics. My favorite branch of mathematics is combinatorial game theory (though I am a newbie in it).

My hobbies include chess, reading, listening to music, and writing (essays, stories and songs). Apart from mathematics I am interested in philosophy.

5
answers
10
questions
~4k
people reached
  • India
  • Member for 2 years, 2 months
  • 88 profile views
  • Last seen 11 hours ago

Communities (32)

Top network posts

Top tags (16)

Score 6
Posts 3
Posts % 20
Score 6
Posts 2
Score 6
Posts 1
Score 6
Posts 1
Score 1
Posts 4
Score 1
Posts 4
View all tags →

Top posts (15) All Questions Answers | Votes Newest

11 Maximum matching M with the condition G[M] is 2K_2-free Mar 6 '18
11 “Almost all objects have property P” vs. “It is easy to test whether an object has property P” Jan 20
6 Limited number of variable occurrences in 1-in-3 SAT Mar 30 '19
5 Maximum matching M with the condition G[M] is 2K_2-free Nov 29 '19
2 Book recommendation treewidth Jul 24 '19
2 Does distance-2 coloring fit in Telle and Proskurowski 's algorithm for partial-k trees? Jan 20
1 Is the counting version of 1-in-3 Sat #P-complete? Jan 20
1 Problems that are NP-hard to approximate even when the input graph is regular Jan 29
1 Maximum matching M with the condition G[M] is 2K_2-free Mar 7 '18
0 Is the counting version of 1-in-3 Sat #P-complete? Jan 20
View all questions and answers →

Badges (21)

Gold

—

Silver

4

Rarest

Bronze

17

Rarest

View all badges →