mastodontech.de ist einer von vielen unabhängigen Mastodon-Servern, mit dem du dich im Fediverse beteiligen kannst.
Offen für alle (über 16) und bereitgestellt von Markus'Blog

Serverstatistik:

1,5 Tsd.
aktive Profile

#graphtheory

1 Beitrag1 Beteiligte*r0 Beiträge heute
CITO Greenhouse<p>Multilayer Network Neuroscience: Decoding the Brain’s Complex Systems</p><p><a href="https://mastodon.social/tags/NetworkNeuroscience" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>NetworkNeuroscience</span></a> <a href="https://mastodon.social/tags/BrainConnectivity" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>BrainConnectivity</span></a> <a href="https://mastodon.social/tags/Connectome" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>Connectome</span></a> <a href="https://mastodon.social/tags/Neuroscience" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>Neuroscience</span></a> <a href="https://mastodon.social/tags/BrainMapping" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>BrainMapping</span></a> <a href="https://mastodon.social/tags/GraphTheory" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>GraphTheory</span></a> <a href="https://mastodon.social/tags/MultilayerNetworks" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>MultilayerNetworks</span></a> <a href="https://mastodon.social/tags/BrainResearch" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>BrainResearch</span></a> <a href="https://mastodon.social/tags/Neurotechnology" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>Neurotechnology</span></a> <a href="https://mastodon.social/tags/PersonalizedMedicine" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>PersonalizedMedicine</span></a> <a href="https://mastodon.social/tags/BrainHealth" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>BrainHealth</span></a> <a href="https://mastodon.social/tags/CognitiveScience" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>CognitiveScience</span></a> <a href="https://mastodon.social/tags/Neuroimaging" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>Neuroimaging</span></a> <a href="https://mastodon.social/tags/BrainScience" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>BrainScience</span></a></p><p><a href="https://youtube.com/shorts/LdGsiQgeW14?feature=share" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://</span><span class="ellipsis">youtube.com/shorts/LdGsiQgeW14</span><span class="invisible">?feature=share</span></a></p>
Fractal Kitty<p>A friend showed me a leetcode problem yesterday at the Recurse Center:</p><p><a href="https://leetcode.com/problems/minimum-height-trees/description/?envType=problem-list-v2&amp;envId=rab78cw1" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://</span><span class="ellipsis">leetcode.com/problems/minimum-</span><span class="invisible">height-trees/description/?envType=problem-list-v2&amp;envId=rab78cw1</span></a></p><p>Which led me to play for a bit on paper, then drafted a rough a visual toy:</p><p><a href="https://codepen.io/fractalkitty/live/WbvJKgy" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://</span><span class="ellipsis">codepen.io/fractalkitty/live/W</span><span class="invisible">bvJKgy</span></a></p><p>(I haven't actually done any leetcode problems because I often end up on paper and down rabbit holes)</p><p><a href="https://mathstodon.xyz/tags/recurseCenter" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>recurseCenter</span></a> <a href="https://mathstodon.xyz/tags/graphtheory" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>graphtheory</span></a> <a href="https://mathstodon.xyz/tags/trees" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>trees</span></a> <a href="https://mathstodon.xyz/tags/codepen" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>codepen</span></a> <a href="https://mathstodon.xyz/tags/leetcode" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>leetcode</span></a></p>
Peter Cock<p>Blog post: <a href="https://astrobeano.blogspot.com/2025/05/ergo-mech-keyboard-wiring-using-tutte-coxeter-graph.html" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://</span><span class="ellipsis">astrobeano.blogspot.com/2025/0</span><span class="invisible">5/ergo-mech-keyboard-wiring-using-tutte-coxeter-graph.html</span></a></p><p>Building on T.G. Marbach's <a href="https://fediscience.org/tags/GraphTheory" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>GraphTheory</span></a> idea to use the Heawood graph for a split keyboard <a href="https://fediscience.org/tags/MechanicalKeyboard" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>MechanicalKeyboard</span></a> (see <a href="https://astrobeano.blogspot.com/2025/05/topology-meets-custom-keyboard-circuit.html" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://</span><span class="ellipsis">astrobeano.blogspot.com/2025/0</span><span class="invisible">5/topology-meets-custom-keyboard-circuit.html</span></a>), I've applied the larger Tutte-Coxeter (Tutte 8 Cage) to sketch diode-free 34, 36, 40, &amp; 42 key <a href="https://fediscience.org/tags/ErgonomicKeyboard" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>ErgonomicKeyboard</span></a> PCB layouts.</p>
Fractal Kitty<p>I am starting a new series on the blog for inquiries in math. I posted the first one today:</p><p><a href="https://www.fractalkitty.com/inquiries-week-1-circle-shading/" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://www.</span><span class="ellipsis">fractalkitty.com/inquiries-wee</span><span class="invisible">k-1-circle-shading/</span></a></p><p><a href="https://mathstodon.xyz/tags/mtbos" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>mtbos</span></a> <a href="https://mathstodon.xyz/tags/iteachmath" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>iteachmath</span></a> <a href="https://mathstodon.xyz/tags/circles" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>circles</span></a> <a href="https://mathstodon.xyz/tags/graphtheory" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>graphtheory</span></a> <a href="https://mathstodon.xyz/tags/math" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>math</span></a></p>
Amusement Logic<p>A century-old enigma, graph theory and design<br>Behind a static form, there are connections, transformations and, above all, the elegance of mathematics.</p><p>👉 Discover MORE and SUBSCRIBE to our summary of news and updates through link: <a href="https://amusementlogic.com/general-news/a-century-old-enigma-graph-theory-and-design/" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://</span><span class="ellipsis">amusementlogic.com/general-new</span><span class="invisible">s/a-century-old-enigma-graph-theory-and-design/</span></a></p><p>📐 <a href="https://mastodon.social/tags/graphtheory" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>graphtheory</span></a> <a href="https://mastodon.social/tags/mathematicaldesign" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>mathematicaldesign</span></a> <a href="https://mastodon.social/tags/geometry" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>geometry</span></a> <a href="https://mastodon.social/tags/science" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>science</span></a> <a href="https://mastodon.social/tags/designscience" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>designscience</span></a> <a href="https://mastodon.social/tags/topology" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>topology</span></a> <a href="https://mastodon.social/tags/computationaldesign" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>computationaldesign</span></a> <a href="https://mastodon.social/tags/teoriadegrafos" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>teoriadegrafos</span></a> <a href="https://mastodon.social/tags/dise%C3%B1omatematico" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>diseñomatematico</span></a> <a href="https://mastodon.social/tags/geometria" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>geometria</span></a> <a href="https://mastodon.social/tags/ciencia" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>ciencia</span></a> <a href="https://mastodon.social/tags/topologia" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>topologia</span></a> <a href="https://mastodon.social/tags/dise%C3%B1ocomputacional" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>diseñocomputacional</span></a> <a href="https://mastodon.social/tags/sabiasque" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>sabiasque</span></a> <a href="https://mastodon.social/tags/saviezvousque" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>saviezvousque</span></a> <a href="https://mastodon.social/tags/th%C3%A9oriedesgraphes" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>théoriedesgraphes</span></a></p>
LavX News<p>Revolutionizing Graph Theory: The Breakthrough in Edge Coloring Algorithms</p><p>In a remarkable leap forward, researchers have unveiled a groundbreaking algorithm for graph edge coloring that promises to drastically reduce computation time. This new approach, leveraging innovativ...</p><p><a href="https://news.lavx.hu/article/revolutionizing-graph-theory-the-breakthrough-in-edge-coloring-algorithms" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://</span><span class="ellipsis">news.lavx.hu/article/revolutio</span><span class="invisible">nizing-graph-theory-the-breakthrough-in-edge-coloring-algorithms</span></a></p><p><a href="https://ioc.exchange/tags/news" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>news</span></a> <a href="https://ioc.exchange/tags/tech" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>tech</span></a> <a href="https://ioc.exchange/tags/AlgorithmOptimization" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>AlgorithmOptimization</span></a> <a href="https://ioc.exchange/tags/GraphTheory" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>GraphTheory</span></a> <a href="https://ioc.exchange/tags/EdgeColoring" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>EdgeColoring</span></a></p>
Hacker News<p>Relational Graph Transformers</p><p><a href="https://kumo.ai/research/relational-graph-transformers/" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://</span><span class="ellipsis">kumo.ai/research/relational-gr</span><span class="invisible">aph-transformers/</span></a></p><p><a href="https://mastodon.social/tags/HackerNews" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>HackerNews</span></a> <a href="https://mastodon.social/tags/Relational" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>Relational</span></a> <a href="https://mastodon.social/tags/Graph" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>Graph</span></a> <a href="https://mastodon.social/tags/Transformers" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>Transformers</span></a> <a href="https://mastodon.social/tags/AI" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>AI</span></a> <a href="https://mastodon.social/tags/Research" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>Research</span></a> <a href="https://mastodon.social/tags/GraphTheory" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>GraphTheory</span></a> <a href="https://mastodon.social/tags/MachineLearning" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>MachineLearning</span></a> <a href="https://mastodon.social/tags/DataScience" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>DataScience</span></a></p>
Steven Carneiro<p>Graphs &amp; conjectures:<br><a href="https://social.vivaldi.net/tags/mathematics" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>mathematics</span></a> <a href="https://social.vivaldi.net/tags/graphtheory" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>graphtheory</span></a> <a href="https://social.vivaldi.net/tags/networks" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>networks</span></a> <a href="https://social.vivaldi.net/tags/research" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>research</span></a> <a href="https://social.vivaldi.net/tags/science" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>science</span></a><br>🤓</p><p><a href="https://www.quantamagazine.org/new-proof-settles-decades-old-bet-about-connected-networks-20250418/" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://www.</span><span class="ellipsis">quantamagazine.org/new-proof-s</span><span class="invisible">ettles-decades-old-bet-about-connected-networks-20250418/</span></a></p>
Warren<p><span>Ok, someone more familiar with graph theory tell me how to compute a minimum weight perfect matching on a complete graph with even-number of vertices? Or at least point me to a resource?<br><br>It's all either left as an exercise to the reader, extremely complex algorithms (Blossom or something?), or weird libraries, where apparently if I use it on complex graphs it's not necessary, but they then point me to even more complex papers.<br><br>Thought I had it solved but now it's returning a matching that's too small.<br><br></span><a href="https://shonk.mizah.xyz/tags/graphtheory" rel="nofollow noopener" target="_blank">#graphtheory</a> <a href="https://shonk.mizah.xyz/tags/computerscience" rel="nofollow noopener" target="_blank">#computerscience</a> <a href="https://shonk.mizah.xyz/tags/academia" rel="nofollow noopener" target="_blank">#academia</a></p>
Jack Linke 🦄<p>Without formal training, the way I modeled physical distribution system <a href="https://social.jacklinke.com/tags/Infrastructure" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>Infrastructure</span></a> for utilities districts in my <a href="https://social.jacklinke.com/tags/Django" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>Django</span></a> app evolved significantly over time.</p><p>As I learned more about graph theory and simulation, I figured out how to model for both the physical structure and the logical aspects of their interconnection and behavior in various scenarios.</p><p><a href="https://social.jacklinke.com/tags/GraphTheory" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>GraphTheory</span></a> <a href="https://social.jacklinke.com/tags/WaterInfrastructure" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>WaterInfrastructure</span></a> <a href="https://social.jacklinke.com/tags/Modeling" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>Modeling</span></a></p><p>1/6</p>
Eugene Alvin Villar 🇵🇭<p>This video is a really pretty visualization of the A* pathfinding algorithm using <a href="https://en.osm.town/tags/OpenStreetMap" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>OpenStreetMap</span></a> road network data for <a href="https://en.osm.town/tags/Chicago" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>Chicago</span></a> and <a href="https://en.osm.town/tags/Rome" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>Rome</span></a> as examples.</p><p><a href="https://youtu.be/CgW0HPHqFE8" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://</span><span class="">youtu.be/CgW0HPHqFE8</span><span class="invisible"></span></a></p><p><a href="https://en.osm.town/tags/ComputerScience" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>ComputerScience</span></a> <a href="https://en.osm.town/tags/algorithms" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>algorithms</span></a> <a href="https://en.osm.town/tags/GraphTheory" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>GraphTheory</span></a> <a href="https://en.osm.town/tags/dataviz" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>dataviz</span></a></p>
Benjamin Smith<p>Calling all <a href="https://fosstodon.org/tags/igraph" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>igraph</span></a> enthusiasts!</p><p>We've identified and fixed a bug in {ig.degree.betweenness} related to the cluster_edge_betweenness() function. </p><p>The issue stemmed from a grep() action used for subgraph identification.</p><p>A fix has been implemented, and an update has been pushed to CRAN—it will be available in the coming days.</p><p>In the meantime, you can reinstall from the main branch here: <a href="https://github.com/benyamindsmith/ig.degree.betweenness" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://</span><span class="ellipsis">github.com/benyamindsmith/ig.d</span><span class="invisible">egree.betweenness</span></a></p><p><a href="https://fosstodon.org/tags/RStats" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>RStats</span></a> <a href="https://fosstodon.org/tags/DataScience" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>DataScience</span></a> <a href="https://fosstodon.org/tags/GraphTheory" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>GraphTheory</span></a> <a href="https://fosstodon.org/tags/BugFix" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>BugFix</span></a></p>
Ross Kang<p>A question for the (combinatorial) hive mind.</p><p>There are a lot of extremal results that are matched asymptotically by some probabilistic construction, but with some gap, often quite substantial. I'm thinking about the Ramsey numbers R(k,k) or R(3,k), but examples of this phenomenon are prevalent.</p><p>I'm curious, does someone out there know of good examples of (extremal) results where some probabilistic construction (e.g. via a random graph) is matched asymptotically, and very precisely?</p><p><a href="https://mathstodon.xyz/tags/graphtheory" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>graphtheory</span></a> <a href="https://mathstodon.xyz/tags/combinatorics" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>combinatorics</span></a></p>
zartom<p>Visualizing Interconnected Networks with Matplotlib and NetworkX<br>Learn to visualize complex networks using Network Visualization Matplotlib &amp; NetworkX in Python. Create insightful visualizations &amp; communicate complex data clearly! <a href="https://mastodon.social/tags/NetworkVisualization" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>NetworkVisualization</span></a> <a href="https://mastodon.social/tags/Python" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>Python</span></a> <a href="https://mastodon.social/tags/Matplotlib" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>Matplotlib</span></a> <a href="https://mastodon.social/tags/NetworkX" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>NetworkX</span></a> <a href="https://mastodon.social/tags/DataVisualization" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>DataVisualization</span></a> <a href="https://mastodon.social/tags/GraphTheory" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>GraphTheory</span></a><br><a href="https://tech-champion.com/programming/python-programming/visualizing-interconnected-networks-with-matplotlib-and-networkx/" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://</span><span class="ellipsis">tech-champion.com/programming/</span><span class="invisible">python-programming/visualizing-interconnected-networks-with-matplotlib-and-networkx/</span></a></p>
zartom<p>Efficiently Creating and Visualizing Symmetric Adjacency Matrices in Python<br>Master Python Adjacency Matrix techniques! Learn efficient creation, NetworkX visualization, &amp;amp; handling of large datasets. Represent &amp;amp; analyze complex relationships in your data. <a href="https://mastodon.social/tags/PythonAdjacencyMatrix" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>PythonAdjacencyMatrix</span></a> <a href="https://mastodon.social/tags/GraphTheory" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>GraphTheory</span></a> <a href="https://mastodon.social/tags/NetworkX" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>NetworkX</span></a> <a href="https://mastodon.social/tags/DataVisualization" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>DataVisualization</span></a> <a href="https://mastodon.social/tags/DataScience" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>DataScience</span></a> <a href="https://mastodon.social/tags/GraphAlgorithms" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>GraphAlgorithms</span></a><br><a href="https://tech-champion.com/programming/python-programming/efficiently-creating-and-visualizing-symmetric-adjacency-matrices-in-python/" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://</span><span class="ellipsis">tech-champion.com/programming/</span><span class="invisible">python-programming/efficiently-creating-and-visualizing-symmetric-adjacency-matrices-in-python/</span></a></p>
zartom<p>Network Graph Visualization: Improving Clarity in Dense Clusters with NetworkX<br>Improve Network Graph Visualization with NetworkX &amp; Matplotlib! Learn simple yet effective strategies to enhance clarity, especially in dense clusters. Explore alternative layout algorithms &amp; parameter adjustments for insightful data representation. <a href="https://mastodon.social/tags/NetworkGraphVisualization" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>NetworkGraphVisualization</span></a> <a href="https://mastodon.social/tags/NetworkX" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>NetworkX</span></a> <a href="https://mastodon.social/tags/Matplotlib" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>Matplotlib</span></a> <a href="https://mastodon.social/tags/DataVisualization" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>DataVisualization</span></a> <a href="https://mastodon.social/tags/GraphTheory" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>GraphTheory</span></a> <a href="https://mastodon.social/tags/Python" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>Python</span></a><br><a href="https://tech-champion.com/programming/python-programming/network-graph-visualization-improving-clarity-in-dense-clusters-with-networkx/" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://</span><span class="ellipsis">tech-champion.com/programming/</span><span class="invisible">python-programming/network-graph-visualization-improving-clarity-in-dense-clusters-with-networkx/</span></a></p>
Ross Kang<p>A post of <span class="h-card" translate="no"><a href="https://mathstodon.xyz/@11011110" class="u-url mention" rel="nofollow noopener" target="_blank">@<span>11011110</span></a></span> has reminded me that (after a year and a half lurking here) it's never too late for me to toot and pin an intro here.</p><p>I am a Canadian mathematician in the Netherlands, and I have been based at the University of Amsterdam since 2022. I also have some rich and longstanding ties to the UK, France, and Japan.</p><p>My interests are somewhere in the nexus of Combinatorics, Probability, and Algorithms. Specifically, I like graph colouring, random graphs, and probabilistic/extremal combinatorics. I have an appreciation for randomised algorithms, graph structure theory, and discrete geometry.</p><p>Around 2020, I began taking a more active role in the community, especially in efforts towards improved fairness and openness in science. I am proud to be part of a team that founded the journal, Innovations in Graph Theory (<a href="https://igt.centre-mersenne.org/" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://</span><span class="">igt.centre-mersenne.org/</span><span class="invisible"></span></a>), that launched in 2023. (That is probably the main reason I joined mathstodon!) I have also been a coordinator since 2020 of the informal research network, A Sparse (Graphs) Coalition (<a href="https://sparse-graphs.mimuw.edu.pl/" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://</span><span class="">sparse-graphs.mimuw.edu.pl/</span><span class="invisible"></span></a>), devoted to online collaborative workshops. In 2024, I helped spearhead the MathOA Diamond Open Access Stimulus Fund (<a href="https://www.mathoa.org/diamond-open-access-stimulus-fund/" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://www.</span><span class="ellipsis">mathoa.org/diamond-open-access</span><span class="invisible">-stimulus-fund/</span></a>).</p><p>Until now, my posts have mostly been about scientific publishing and combinatorics.</p><p><a href="https://mathstodon.xyz/tags/introduction" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>introduction</span></a> <br><a href="https://mathstodon.xyz/tags/openscience" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>openscience</span></a> <br><a href="https://mathstodon.xyz/tags/diamondopenaccess" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>diamondopenaccess</span></a> <br><a href="https://mathstodon.xyz/tags/scientificpublishing" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>scientificpublishing</span></a> <br><a href="https://mathstodon.xyz/tags/openaccess" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>openaccess</span></a> <br><a href="https://mathstodon.xyz/tags/RemoteConferences" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>RemoteConferences</span></a> <br><a href="https://mathstodon.xyz/tags/combinatorics" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>combinatorics</span></a> <br><a href="https://mathstodon.xyz/tags/graphtheory" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>graphtheory</span></a> <br><a href="https://mathstodon.xyz/tags/ExtremalCombinatorics" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>ExtremalCombinatorics</span></a> <br><a href="https://mathstodon.xyz/tags/probability" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>probability</span></a></p>
LavX News<p>Revolutionizing Mathematics: The Rise of Automated Conjecturing with TxGraffiti</p><p>In a groundbreaking advancement for the field of mathematics, the newly introduced program TxGraffiti is set to automate the generation of mathematical conjectures, particularly within graph theory. T...</p><p><a href="https://news.lavx.hu/article/revolutionizing-mathematics-the-rise-of-automated-conjecturing-with-txgraffiti" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://</span><span class="ellipsis">news.lavx.hu/article/revolutio</span><span class="invisible">nizing-mathematics-the-rise-of-automated-conjecturing-with-txgraffiti</span></a></p><p><a href="https://mastodon.social/tags/news" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>news</span></a> <a href="https://mastodon.social/tags/tech" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>tech</span></a> <a href="https://mastodon.social/tags/AutomatedConjecturing" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>AutomatedConjecturing</span></a> <a href="https://mastodon.social/tags/GraphTheory" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>GraphTheory</span></a> <a href="https://mastodon.social/tags/MathematicsAI" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>MathematicsAI</span></a></p>
Rachel Wright<p>I'm doing some of my "follow the instructions for a change" <a href="https://mathstodon.xyz/tags/Sashiko" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>Sashiko</span></a>, and came upon a bit that I think means I can't do everything that's left without a lot of stopping and starting.</p><p>Then I realised I have an actual graph theorist in the house who might see something I'd missed.</p><p>So I checked with <span class="h-card" translate="no"><a href="https://mathstodon.xyz/@ColinTheMathmo" class="u-url mention" rel="nofollow noopener" target="_blank">@<span>ColinTheMathmo</span></a></span>, and he did spot something I'd missed, but it confirmed the impossibility.</p><p>I'll have to fudge it...</p><p><a href="https://mathstodon.xyz/tags/MathsChat" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>MathsChat</span></a> <a href="https://mathstodon.xyz/tags/GraphTheory" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>GraphTheory</span></a> <a href="https://mathstodon.xyz/tags/HandEmbroidery" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>HandEmbroidery</span></a></p>
Steven Carneiro<p>The "Bunkbed Conjecture" debunked:<br><a href="https://social.vivaldi.net/tags/mathematics" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>mathematics</span></a> <a href="https://social.vivaldi.net/tags/graphtheory" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>graphtheory</span></a> <a href="https://social.vivaldi.net/tags/physics" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>physics</span></a> <a href="https://social.vivaldi.net/tags/research" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>research</span></a> <a href="https://social.vivaldi.net/tags/science" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>science</span></a><br>🤓</p><p><a href="https://www.quantamagazine.org/maths-bunkbed-conjecture-has-been-debunked-20241101/" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://www.</span><span class="ellipsis">quantamagazine.org/maths-bunkb</span><span class="invisible">ed-conjecture-has-been-debunked-20241101/</span></a></p>