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

DOI10.1007/S00373-024-02861-XMaRDI QIDQ6650720FDOQ6650720

Authors: Patrick Bennett, Ryan Cushman, Andrzej Dudek, Elizabeth Sprangel 

Publication date: 9 December 2024

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Recommendations

• Edge-colouring random graphs
• On the chromatic number of random graphs
• Generalized Chromatic Numbers of Random Graphs
• The classification of \(f\)-coloring of random graphs
• Almost all graphs with 2. 522\(n\) edges are not 3-colorable

zbMATH Keywords

Lagrange multipliersrandom graphsnon-isomorphic colorings

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Enumeration in graph theory (05C30)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• On the combinatorial problems which I would most like to see solved
• The size Ramsey number of a directed path
• An alternative proof of the linearity of the size-Ramsey number of paths
• Factors in random graphs
• Packing Hamilton cycles in random and pseudo-random hypergraphs
• Random triangles in random graphs
• Edge-disjoint Hamilton cycles in random graphs
• Optimal packings of Hamilton cycles in sparse random graphs
• Packing trees of unbounded degrees in random graphs
• Matching and covering the vertices of a random graph by copies of a given graph
• A threshold for perfect matchings in random d-pure hypergraphs
• Asymptotics for Shamir's problem
• Random cliques in random graphs and sharp thresholds for F$$ F $$‐factors

This page was built for publication: A note on non-isomorphic edge-color classes in random graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6650720)