« first day (2946 days earlier)      last day (37 days later) » 

4:18 AM
@MartinSleziak The tag was removed and then added again: math.stackexchange.com/posts/3740881/revisions
1
Q: There is a cycle in $G$ of size not multiple of $3$ if every vertex of $G$ has degree $\geq 3$.

AVISEK SHARMAProblem Let $G$ be a simple graph such that for each vertex $v$ of $G$, $\operatorname{deg}(v)\geq 3$. Then show that there is a cycle in $G$ of size not multiple of $3$. Attempt Let $P$ be a maximal path of $G$ and $v$ is one of its end point. Now $\operatorname{deg}(v)\geq 3$, so there are tw...

 
 
8 hours later…
12:26 PM
Please do not create tags at will. If you do, please add a tag exercpt and a tag wiki to avoid incorrect usage. — YuiTo Cheng 4 hours ago
What is the problem in the tag, simple graph? — AVISEK SHARMA 2 hours ago
The term simple graph means that multiple edges are not allowed - as opposed to ?
Is it unambiguous, or do some people use it in a different meaning?
 
12:52 PM
Speaking of various types of graphs, there is also a tag called . And the tag called existed briefly in 2014: math.stackexchange.com/posts/938519/revisions
 
 
10 hours later…
10:50 PM
0
A: Tag management 2020

IntegrandProposal: Combine ceiling-function and floor-function, maybe into ceiling-and-floor-functions. This feels similar to limsup-and-liminf: yes, there are results that deal exclusively with one of the two (for instance, Fatou's Lemma and liminf; or questions about Waring's problem and floors), but th...

 

« first day (2946 days earlier)      last day (37 days later) »