Skip to main content
Tour
About Us
Meta
Loading…
current community
Stack Exchange
chat
Meta Stack Exchange
your communities
Sign up
or
log in
to customize your list.
more stack exchange communities
company blog
Log in
Stack Exchange
All Sites
Top 400 Users
Digests
Cyriac Antony
India
top
accounts
reputation
activity
subscriptions
Top Questions
34
votes
How can we make chess community welcoming to women/girls?
clubs
women
asked Jan 22, 2020 at 12:01
chess.stackexchange.com
22
votes
removing isolated vertices in networkx
python
networkx
asked Feb 16, 2018 at 5:28
stackoverflow.com
13
votes
"Almost all objects have property P" vs. "It is easy to test whether an object has property P"
cc.complexity-theory
pr.probability
asked Jan 20, 2020 at 6:20
cstheory.stackexchange.com
11
votes
Maximum matching M with the condition G[M] is 2K_2-free
matching
asked Mar 6, 2018 at 5:00
cstheory.stackexchange.com
11
votes
Moving absolutely pinned piece to give checkmate: has this ever occured in a master game?
checkmate
master-games
pins
cql
asked May 3, 2021 at 15:14
chess.stackexchange.com
10
votes
Is there a planar 4-regular graph that is 3-acyclic colourable?
graph-theory
planar-graphs
graph-colouring
asked Jun 9, 2020 at 6:43
cstheory.stackexchange.com
10
votes
Term for checkmate where every participating piece attacks exactly one square around king
checkmate
terminology
composing
asked May 2, 2021 at 6:10
chess.stackexchange.com
8
votes
How do you play the King's Indian Attack aggressively?
opening
aggressive-play
kings-indian-attack
asked Feb 12, 2020 at 8:32
chess.stackexchange.com
8
votes
Infinite sequence of consecutive checks allowing more pieces (say 9+ queens)
problems
check
asked Jul 2, 2020 at 7:39
chess.stackexchange.com
7
votes
How to put a tikz node on the rounded corner?
tikz-pgf
asked Dec 20, 2018 at 5:49
tex.stackexchange.com
1
2
next
Top Answers
10
Cantor set is compact?
math.stackexchange.com
6
Limited number of variable occurrences in 1-in-3 SAT
cstheory.stackexchange.com
5
Carlsen-Caruana Game 12
chess.stackexchange.com
5
Maximum matching M with the condition G[M] is 2K_2-free
cstheory.stackexchange.com
Stack Exchange works best with JavaScript enabled