bio  website  tx.technion.ac.il/~felixg/… 

location  
age  30  
visits  member for  2 years, 5 months 
seen  13 hours ago  
stats  profile views  2,957 
1d

revised 
A conjecture about strongly regular graphs
deleted 64 characters in body 
1d

answered  A conjecture about strongly regular graphs 
2d

comment 
A conjecture about strongly regular graphs
@FedorPetrov Yes, let's exclude it. 
2d

revised 
A conjecture about strongly regular graphs
added 104 characters in body 
2d

asked  A conjecture about strongly regular graphs 
Aug 17 
asked  Fullrank factorization of the graph Laplacian 
Aug 16 
comment 
Duration and critical groups order in sandpile models and chip firing games
@SamHopkins But the critical configurations are recurrent and stable, are they not? 
Aug 14 
asked  Duration and critical groups order in sandpile models and chip firing games 
Jul 23 
comment 
special 1factorization of regular bipartite graphs
Is there always a 1factorization of such a graph, even without the extra requirement? 
Jul 2 
awarded  Inquisitive 
Jul 2 
awarded  Curious 
Jun 17 
comment 
Roots of modified polynomials
I am not so sure, actually. Please note that I was asking about modified rather than perturbed polynomials, for a reason: the difference between $g$ and $h$ is not assumed to be small. 
Jun 17 
revised 
Roots of modified polynomials
edited tags 
Jun 17 
asked  Roots of modified polynomials 
Jun 2 
asked  Spectral lower bounds on the diameter of a graph 
Jun 1 
comment 
Rank 1 Approximation of Elementwise Inverse Matrix
Probably something to do with scaling as in SinkhornKnopp scaling. 
Jun 1 
comment 
Rank 1 Approximation of Elementwise Inverse Matrix
What is the connection to inverses? 
May 28 
comment 
Are all almost regular graphs obvious?
Yuster's work is my favourite example of why such irregularity measures are useful :) 
May 27 
comment 
Are all almost regular graphs obvious?
Ah, good point about the multigraphs. But I really do want my regular graph to be simple in this instance. (Although I mind loops less). 
May 27 
comment 
Are all almost regular graphs obvious?
But there might be some edges between the even set already in place. In other words  the subgraph induced by the even set is not necessarily empty, how are we sure it has a perfect mathching? I am not saying I think it's wrong, but I don't see how pairing them up can be enough. 