Equating two maximum degrees

zbMath1405.05118arXiv1704.08472MaRDI QIDQ4622615

Yair Caro, Josef Lauri, Christina Zarb

Publication date: 13 February 2019

Full work available at URL: https://arxiv.org/abs/1704.08472

zbMATH Keywords

induced subgraphmaximum degree

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex degrees (05C07) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (4)

Equating \(\kappa\) maximum degrees in graphs without short cycles ⋮ Large induced subgraphs with three repeated degrees ⋮ Large Induced Subgraphs with $k$ Vertices of Almost Maximum Degree ⋮ Induced subgraphs with many repeated degrees

Cites Work

• Regular independent sets
• Forcing \(k\)-repetitions in degree sequences
• Large induced subgraphs with equated maximum degree
• Repetition number of graphs
• Ramsey problems involving degrees in edge-colored complete graphs of vertices belonging to monochromatic subgraphs
• Lower bounds for constant degree independent sets
• Independent sets and repeated degrees
• Degree multiplicities and independent sets in \(K_ 4\)-free graphs
• Degree sequence and independence in \(K(4)\)-free graphs
• Random Hypergraph Irregularity
• Rainbow neighbourhood number of graphs
• Large Induced Subgraphs with $k$ Vertices of Almost Maximum Degree
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Equating two maximum degrees