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

DOI10.1007/s00373-024-02861-xMaRDI QIDQ6650720

Elizabeth Sprangel, Ryan Cushman, Andrzej Dudek, Patrick Bennett

Publication date: 9 December 2024

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

zbMATH Keywords

Lagrange multipliersrandom graphsnon-isomorphic colorings

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• The size Ramsey number of a directed path
• On the combinatorial problems which I would most like to see solved
• 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
• Packing hamilton cycles in random and pseudo-random hypergraphs
• Factors in random graphs
• Optimal Packings of Hamilton Cycles in Sparse Random Graphs
• Packing trees of unbounded degrees in random graphs
• Edge-disjoint Hamilton cycles in random graphs
• An Alternative Proof of the Linearity of the Size-Ramsey Number of Paths
• Random cliques in random graphs and sharp thresholds for F$$ F $$‐factors
• Random triangles in random graphs

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