« first day (2361 days earlier)      last day (1539 days later) » 

9:12 AM
The tag now has 150 questions. It was close to 200 in August 2017 (195 on August 9, 190 on August 11.)
If we only count questions with the tag and without , there are 67 such questions. And there are 30 questions with and with no top-level tag.
@YCor The syntax for tags is [tag:tagname] and for meta [meta-tag:tagname] - it is the same as in the posts. (It probably does not work in rooms which aren't associated with any site. That is most likely explanation why it did not work in the sandbox.)
Anyway I see that you have figured that out yourself.
One useful advice is that if you want to see how somebody typed something in chat message, you can access the source of the chat message through history, like this: chat.stackexchange.com/messages/53419533/history (Similarly as on main/meta it is possible to check source of the post.)
More details on this can be found in this message on Meta Stack Exchange: How to view/copy source of a message in chat?
 
I hope you don't mind that I have added you as a room owner - it seemed a reasonable step since you're active on MO in editing and tag-related issues. And now you are more frequently in chat than you used to be.
Of course, if you prefer not to be room owner, you can simply remove yourself from the list. (One of the things that room owners can do is adding/removing room owners.)
 
 
1 hour later…
10:35 AM
0
Q: Graph Theory and Subgraphs

Dale BryantLet $T = (V , E)$ be a tree with $|V | = n ≥ 2$. How many distinct paths are there (as sub graphs) in $T$? I already have the answer to this question as $(n/2)$. The problem that I'm having is finding anything in the text that helps me to figure out how to arrive at this answer.

@Martin you've bumped the above old closed question (to remove a deprecated tag); I think it's also an opportunity to vote it for deletion.
There are also many highly off-topic closed old questions tagged by the way, and also with no deprecated tags. In this case I should be possible to delete them without bumping.
I thought at some point of writing a post on meta "Should we delete or reopen these old posts?" with a list of questions, at least 1 year old. Most/all should be deleted, which needs 3 votes, but there might be exceptions (typically, an unclear post that has been closed, amended, and eventually forgotten).
 
 
3 hours later…
1:15 PM
0
Q: Would introducing an "operations-research" tag be appreciated?

Manfred WeisWhat are your feelings about introducing an operations-research tag? I was tempted of introducing it but as it OR is also covered by combinatorial-optimization or graph-theory and maybe also other fields of mathematics, I am not sure whether such a tag would be considered "superfluous". Wha...

 
1:26 PM
Operations research (British English: operational research) (OR) is a discipline that deals with the application of advanced analytical methods to help make better decisions. Further, the term operational analysis is used in the British (and some British Commonwealth) military as an intrinsic part of capability development, management and assurance. In particular, operational analysis forms part of the Combined Operational Effectiveness and Investment Appraisals, which support British defense capability acquisition decision-making. It is often considered to be a sub-field of applied mathematics...
 
2:21 PM
I'm done with the marathon. There are still a few questions to which this tag can be added but no need to be excessively perfectionist, they already have good tags.
In 6 days I added it to 100 questions... this is a lot of bumping: energy consuming (for me), patience-consuming (for users of the site).
 
1
Q: Should we delete or reopen these old posts?

YCorThe purpose of this question is to link to various old (say $\succeq 1$ year old) closed posts, mostly by no longer active users, most of which are reasonable candidates for deletion, and a few for reopening, while it (in most cases) makes little sense to keep them closed and undeleted. If you h...

I'll just mention that there were some discussion related to manual deletions on MathOverflow: Should we try to re-start manual deletions or is the situation fine anyway? and Decluttering MathOverflow. +1 from me - since this seems like a reasonable thing to discuss. — Martin Sleziak 6 mins ago
As I have mentioned in the above comment, there were some previous discussions about manual deletion (vote to delete). From those links it seems that some MO users are not too keen to vote to delete.
Personally, I can't help with deletions - I do not have sufficient reputation to cast delete votes. (Moreover, this should be discussed mainly by the members of the MO community - as an outsider, I don't have much say in this.)
Regarding the bumped post - you're right that it was probably not an ideal target for retagging.
One problem is that we do not know what moderators plan to do. It seems that they dislike the idea of blacklisting/burninating tags - but so far nobody explained reasons behind this.
If, for example, moderators plan to merge into (after the tag is sufficiently cleaned up), that would replace all occurrences of (discrete-mathematics) by (co.combinatorics) without any bumping. So if this is going to happen, removal of (discrete-mathematics) on the posts where (co.combinatorics) is suitable is indeed unnecessary.
 
 
8 hours later…
10:47 PM
A new tag was created - YCor created also a tag-excerpt.
131
Q: Is a free alternative to MathSciNet possible?

Anton Petrunin How could a free (i.e. free content) alternative for MathSciNet and Zentralblatt be created? Comments Some mathematicians have stopped writing reviews for MathSciNet because they feel their output should be freely available. (The Pricing for MathSciNet is not high, but it is not the point....

3
Q: Math reviews in "Zentralblatt für Mathematik und ihre Grenzgebiete"

studentIs there a website where i could read/download math reviews appeared in the above Journal? Of course, I guess all the reviews are available on ZBMATH https://zbmath.org/, which is not free for access. Besides, the reviews (before 1990s) on ZBMATH are uploaded as scanned files, not very clear and...

31
Q: When to start reviewing

B. BischofRecently I had a few papers published, and I suppose in response to this, I received a request from Zentralblatt to be a reviewer. They ask some general questions about what I would feel comfortable reviewing, and if I would be willing to receive papers electronically. My concern about just signi...

A new tag was created - without waiting on the outcome of the discussion on meta: Would introducing an “operations-research” tag be appreciated? (The tag creator has a pending edit to created the tag-excerpt.)
0
Q: What is known about iterated matching as a TSP heuristic

Manfred WeisA fairly wellknown heuristic for TSP that is based on matching is described in the 2003 paper Match twice and stitch: a new TSP tour construction heuristic by Andrew B. Kahng and Sherief Reda. Its basic idea is to generate a vertex-covering collection of even cycles via the union of two edge-disj...

 

« first day (2361 days earlier)      last day (1539 days later) »