Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Mathematics > Combinatorics

arXiv:2210.02301 (math)
[Submitted on 5 Oct 2022 (v1), last revised 10 Jan 2023 (this version, v2)]

Title:A note on non-isomorphic edge-color classes in random graphs

Authors:Patrick Bennett, Ryan Cushman, Andrzej Dudek, Elizabeth Sprangel
View PDF
Abstract:For a graph $G$, let $\tau(G)$ be the maximum number of colors such that there exists an edge-coloring of $G$ with no two color classes being isomorphic. We investigate the behavior of $\tau(G)$ when $G=G(n, p)$ is the classical Erdős-Rényi random graph.
Subjects: Combinatorics (math.CO)
Cite as: arXiv:2210.02301 [math.CO]
  (or arXiv:2210.02301v2 [math.CO] for this version)
  https://doi.org/10.48550/arXiv.2210.02301

Submission history

From: Andrzej Dudek [view email]
[v1] Wed, 5 Oct 2022 14:40:08 UTC (21 KB)
[v2] Tue, 10 Jan 2023 23:24:00 UTC (21 KB)
Full-text links:

Access Paper:

  • View PDF
  • TeX Source
  • Other Formats
license icon view license
Current browse context:
math.CO
< prev   |   next >
new | recent | 2022-10
Change to browse by:
math

References & Citations

export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)